P3804 【模板】后缀自动机

SAM模板题

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 2e6+50;
char s[MAXN];
int a[MAXN],c[MAXN];
struct Suffix{
    int last=1,tot=1;
    int nxt[MAXN][26],fa[MAXN],len[MAXN],sz[MAXN];
    void Insert(int x){
        int p = last,np = ++tot;
        last = np,len[np] = len[p] + 1;
        for(;p && !nxt[p][x];p=fa[p]) nxt[p][x] = np;
        if(!p) fa[np] = 1;
        else {
            int q = nxt[p][x];
            if(len[p]+1 == len[q]) fa[np] = q;
            else {
                int nq = ++tot;
                len[nq] = len[p] + 1;
                memcpy(nxt[nq],nxt[q],sizeof(nxt[q]));
                fa[nq] = fa[q];
                fa[q] = fa[np] = nq;
                for(;nxt[p][x]==q;p=fa[p])
                    nxt[p][x]=nq;
            }
        }
        sz[np] = 1;
    }
    void Solve(){
        LL res = 0;
        for(int i=1;i<=tot;i++) c[len[i]]++;
        for(int i=1;i<=tot;i++) c[i]+=c[i-1];
        for(int i=1;i<=tot;i++) a[c[len[i]]--]=i;
        for(int i=tot;i;i--){
            int p = a[i];
            sz[fa[p]] += sz[p];
            if(sz[p]>1)
                res = max(res,1LL*sz[p]*len[p]);
        }
        printf("%lld\n",res);
    }
}SAM;
int main(){
    scanf("%s",s+1);
    for(int i=1;s[i];i++) SAM.Insert(s[i]-'a');
    SAM.Solve();
    return 0;
}