[Sdoi2016]生成魔咒[SAM or SA]

#include<map>
#include<cstdio>
using namespace std;
typedef long long ll;
template <typename T>
inline void read(T &x){
    register char ch=getchar();x=0;
    while(ch<‘0‘||ch>‘9‘) ch=getchar();
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
}
const int N=2e5+5;
int n,p,q,np,nq;ll ans;
int last,cnt;
int fa[N],l[N];map<int,int>a[N];
inline void extend(int c){
    p=last;np=last=++cnt;l[np]=l[p]+1;
    while(!a[p][c]&&p) a[p][c]=np,p=fa[p];
    if(!p) fa[np]=1;
    else{
        q=a[p][c];
        if(l[p]+1==l[q]) fa[np]=q;
        else{
            nq=++cnt;l[nq]=l[p]+1;
            a[nq]=a[q];
            fa[nq]=fa[q];
            fa[np]=fa[q]=nq;
            while(a[p][c]==q) a[p][c]=nq,p=fa[p];
        }
    }
    ans+=l[np]-l[fa[np]];
    printf("%lld\n",ans);
}
int main(){
    read(n);last=++cnt;
    for(int i=1,x;i<=n;i++) read(x),extend(x);
    return 0;
}