后缀自动机广搜

///每个节点包含p->pre->step+1~p->step长度的子串
#include <iostream>
#include <string.h>
#include <algorithm>
#include <stdio.h>
using namespace std;
const int N=250005;
struct State{
    State *pre,*go[26];
    int step,num;
    void clear(){
        step=num=0;
        memset(go,0,sizeof(go));pre=0;
    }
};
State statePool[N*2],*cur,*root;
void init(){cur=statePool;root=cur++;root->clear();}
void debug(){
    printf("graph:\n");
    for(State *i=root;i!=cur;i++){
        for(int j=0;j<26;j++)if(i->go[j])printf("%d %c %d\n",i-root,j+'a',i->go[j]-root);
    }
    printf("pre:\n");
    for(State *i=root;i!=cur;i++){
        printf("%d %d\n",i-root,i->pre-root);
    }
}
void fun(State *u,int i){
    State *p=u;
    State *np=u->go[i];
    while(p&&(!p->go[i]||p->go[i]==np))p->go[i]=np,p=p->pre;
    if(p==0)np->pre=root;
    else{
        State *q=p->go[i];
        if(p->step+1==q->step)np->pre=q;
        else{
            State *nq=cur++;
            nq->clear();
            memcpy(nq->go,q->go,sizeof(q->go));
            nq->step=p->step+1;
            nq->pre=q->pre;
            nq->num=0;
            q->pre=nq;
            np->pre=nq;
            while(p&&(p->go[i]==q||p->go[i]==nq))p->go[i]=nq, p=p->pre;
        }
    }
}
char A[N];
int cnt[N];
State* B[N*2];
void build(){
    int ll=0,rr=0;B[rr++]=root;
    while(ll<rr){
        State* u=B[ll++];
        for(int i=0;i<26;i++)if(u->go[i]){
            fun(u,i);B[rr++]=u->go[i];
        }
    }
}

int main(){
    scanf("%s",A);
    int la=strlen(A);
    init();
    State*u=root;
    for(int i=0;i<la;i++){
        int c=A[i]-'a';
        if(!u->go[c]){
            cur->clear();cur->num=1;cur->step=i+1;u->go[c]=cur++;
        }
        u=u->go[c];
    }
    build();
    memset(cnt,0,sizeof(cnt));
    for(State *p=statePool;p!=cur;p++)cnt[p->step]++;
    for(int i=1;i<=la;i++)cnt[i]+=cnt[i-1];
    for(State *p=statePool;p!=cur;p++)B[--cnt[p->step]]=p;
    return 0;
}