Topic Link to
build a \ (SAM \) , the number of different sub-string is \ (\ sum len (i)
-len (fa (i)) \) because \ (SAM \) line, so each character will join a coupled with its direct contribution, so this question is gone.
Since \ (x \) a little big, so the \ (ch \) into \ (map \) on the line.
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
const int MAXN = 1000010;
struct SAM{
map <int, int> ch;
int len, fa;
}sam[MAXN << 1];
int las = 1, cnt = 1;
long long ans;
inline void add(int c){
int p = las; int np = las = ++cnt;
sam[np].len = sam[p].len + 1;
for(; p && !sam[p].ch[c]; p = sam[p].fa) sam[p].ch[c] = np;
if(!p) sam[np].fa = 1;
else{
int q = sam[p].ch[c];
if(sam[q].len == sam[p].len + 1) sam[np].fa = q;
else{
int nq = ++cnt; sam[nq] = sam[q];
sam[nq].len = sam[p].len + 1;
sam[q].fa = sam[np].fa = nq;
for(; p && sam[p].ch[c] == q; p = sam[p].fa) sam[p].ch[c] = nq;
}
}
ans += sam[np].len - sam[sam[np].fa].len;
}
int a, n;
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
scanf("%d", &a);
add(a);
printf("%lld\n", ans);
}
return 0;
}