Bzoj4516 [Sdoi2016]生成魔咒

 1 /*by SilverN*/
 2 #include<algorithm>
 3 #include<iostream>
 4 #include<cstring>
 5 #include<cstdio>
 6 #include<cmath>
 7 #include<vector>
 8 #include<map>
 9 #define LL long long
10 using namespace std;
11 const int mxn=201010;
12 int read(){
13     int x=0,f=1;char ch=getchar();
14     while(ch<‘0‘ || ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
15     while(ch>=‘0‘ && ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
16     return x*f;
17 }
18 void write(LL x){
19     if(x<0)putchar(‘-‘),x=-x;
20     if(x>9)write(x/10);
21     putchar(x%10+‘0‘);
22     return;
23 }
24 struct SAM{
25     map<int,int>t[mxn];
26     int fa[mxn],l[mxn];
27     int S,last,cnt;
28     LL ans;
29     void init(){
30         S=last=cnt=1;ans=0;
31         return;
32     }
33     void add(int c){
34         int p=last,np=++cnt;last=np;
35         l[np]=l[p]+1;
36         for(;p && !t[p][c];p=fa[p])t[p][c]=np;
37         if(!p){fa[np]=S;}
38         else{
39             int q=t[p][c];
40             if(l[q]==l[p]+1){
41                 fa[np]=q;
42             }
43             else{
44                 int nq=++cnt;
45                 l[nq]=l[p]+1;
46                 t[nq]=t[q];
47                 fa[nq]=fa[q];
48                 fa[q]=fa[np]=nq;
49                 for(;p && t[p][c]==q;p=fa[p])t[p][c]=nq;
50             }
51         }
52         ans+=l[np]-l[fa[np]];
53         return;
54     }
55 }sa;
56 int n,x;
57 int main(){
58     int i,j;
59     n=read();
60     sa.init();
61     for(i=1;i<=n;i++){
62         x=read();
63         sa.add(x);
64         write(sa.ans);puts("");
65     }
66     return 0;
67 }