[hihocoder1449] 后缀自动机

[hihocoder1449]

Code

---

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int N=2e6+100;
struct node{int y,n;}e[N];
int n,tmp,len,sz=0,to[N][26],lin[N],ans[N],maxn[N],pre[N],endpos[N];
char s[N];
void read(int x,int y)
{e[++sz].y=y,e[sz].n=lin[x],lin[x]=sz;}
void insert(int c){
	int p=tmp,x=++n,q; tmp=n,endpos[x]=1,maxn[x]=maxn[p]+1;
	while(p&&!to[p][c])to[p][c]=x,p=pre[p];
	if(!p){pre[x]=1;return;}
	if(maxn[q=to[p][c]]==maxn[p]+1)pre[x]=q;
	else{
		int y=++n; maxn[y]=maxn[p]+1;
		memcpy(to[y],to[q],sizeof(to[q]));
		pre[y]=pre[q],pre[q]=pre[x]=y;
		while(to[p][c]==q)to[p][c]=y,p=pre[p];
	}
}
void dfs(int x){
	for(int i=lin[x];i;i=e[i].n){
		int y=e[i].y;
		dfs(y);
		endpos[x]+=endpos[y];
	}
}
int main()
{
	scanf("%s",s+1);
	tmp=n=1; len=strlen(s+1);
	rep(i,1,len)insert(s[i]-'a');
	rep(i,1,n){
		read(pre[i],i);
	}
	dfs(1);
	rep(i,1,n)ans[maxn[i]]=max(ans[maxn[i]],endpos[i]);
	per(i,len-1,1)ans[i]=max(ans[i],ans[i+1]);
	rep(i,1,len)printf("%d\n",ans[i]);
	return 0;
}