算法设计与分析作业.docxVIP

解法一： #includecstdio #includecstring #includecmath #includeiostream #includealgorithm using namespace std; typedef __int64 ll; typedef pairint, int pii; #define fi first #define se second #define mp make_pair #define pb push_back #define sz(x) ((int)(x).size()) #define all(x) (x).begin(),(x).end() #define de(x) cout #x = x endl //------- const int N = 200007; int n, q, a[N], nxt[N]; int main() { scanf(%d%d, n, q); int i; for (i = 1; i = n; ++i) scanf(%d, a + i); nxt[n] = n + 1; for (i = n - 1; i 0; --i) nxt[i] = (a[i] == a[i + 1] ? nxt[i + 1] : i + 1); for (i = 0; i q; +