【链接】h在这里写链接

【题意】

【题解】

【反思】

【代码】

#include<bits/stdc++.h>
#define ll long long
using namespace std;const int N = 2e5;
const int MAX_CHAR = 1e5+10;//每个数字的最大值。
int s[N + 10];//如果是数字,就写成int s[N+10]就好,从0开始存
int Sa[N + 10], T1[N + 10], T2[N + 10], C[N + 10];
int Height[N + 10], Rank[N + 10];
map <int, int> dic;void build_Sa(int n, int m) {int i, *x = T1, *y = T2;for (i = 0; i<m; i++) C[i] = 0;for (i = 0; i<n; i++) C[x[i] = s[i]]++;for (i = 1; i<m; i++) C[i] += C[i - 1];for (i = n - 1; i >= 0; i--) Sa[--C[x[i]]] = i;for (int k = 1; k <= n; k <<= 1){int p = 0;for (i = n - k; i<n; i++) y[p++] = i;for (i = 0; i<n; i++) if (Sa[i] >= k) y[p++] = Sa[i] - k;for (i = 0; i<m; i++) C[i] = 0;for (i = 0; i<n; i++) C[x[y[i]]]++;for (i = 1; i<m; i++) C[i] += C[i - 1];for (i = n - 1; i >= 0; i--) Sa[--C[x[y[i]]]] = y[i];swap(x, y);p = 1; x[Sa[0]] = 0;for (i = 1; i<n; i++)x[Sa[i]] = y[Sa[i - 1]] == y[Sa[i]] && y[Sa[i - 1] + k] == y[Sa[i] + k] ? p - 1 : p++;if (p >= n) break;m = p;}
}void getHeight(int n)
{int i, j, k = 0;for (i = 1; i <= n; i++) Rank[Sa[i]] = i;for (i = 0; i<n; i++) {if (k) k--;j = Sa[Rank[i] - 1];while (s[i + k] == s[j + k]) k++;Height[Rank[i]] = k;}
}const int MAXL = 18;//log2数组的最大长度
const int INF = 0x3f3f3f3f;//数值绝对值的最大值
int n, tot;
set <int> mset;struct abc {int pre2[MAXL + 5], need[N + 10];int fmax[N + 10][MAXL + 5], fmin[N + 10][MAXL + 5];void init(int n){pre2[0] = 1;for (int i = 1; i <= MAXL; i++){pre2[i] = pre2[i - 1] << 1;}need[1] = 0; need[2] = 1;int temp = 2;for (int i = 3; i <= n; i++)//need[i]表示长度为i是2的多少次方,可以理解为[log2i]if (pre2[temp] == i)need[i] = need[i - 1] + 1, temp++;elseneed[i] = need[i - 1];}void getst(int *a, int n){memset(fmax, -INF, sizeof fmax);memset(fmin, INF, sizeof fmin);for (int i = 1; i <= n; i++)//下标从0开始就改成对应的就好fmax[i][0] = fmin[i][0] = a[i];for (int l = 1; pre2[l] <= n; l++)for (int i = 1; i <= n; i++)if (i + pre2[l] - 1 <= n)fmax[i][l] = max(fmax[i][l - 1], fmax[i + pre2[l - 1]][l - 1]);for (int l = 1; pre2[l] <= n; l++)for (int i = 1; i <= n; i++)if (i + pre2[l] - 1 <= n)fmin[i][l] = min(fmin[i][l - 1], fmin[i + pre2[l - 1]][l - 1]);}int getmin(int l, int r){int len = need[r - l + 1];return min(fmin[l][len], fmin[r - pre2[len] + 1][len]);}int getmax(int l, int r){int len = need[r - l + 1];return max(fmax[l][len], fmax[r - pre2[len] + 1][len]);}}ST;int main() {//freopen("F:\\rush.txt", "r", stdin);scanf("%d", &n);for (int i = 0; i <= n-1; i++) {int x;scanf("%d", &x);if (dic[x] == 0) dic[x] = ++tot;s[n-i-1] = dic[x];}s[n] = 0;build_Sa(n + 1, MAX_CHAR);//注意调用n+1getHeight(n);ST.init(n);ST.getst(Height, n);ll ans = 1;mset.insert(Rank[n - 1]);printf("%lld\n", ans);for (int i = n - 2; i >= 0; i--){int mx = 0;set<int>::iterator it = mset.upper_bound(Rank[i]);if (it != mset.end()) mx = max(mx, ST.getmin(Rank[i] + 1, *it));if (it != mset.begin()){it--;mx = max(mx, ST.getmin((*it) + 1, Rank[i]));}ans += n - i - mx;mset.insert(Rank[i]);printf("%lld\n", ans);}return 0;
}