题目描述
题解
同spoj1812
代码
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define N 100005
char s[N];
int T,inf,n,p,np,q,nq,last,root,sz,ans;
int ch[N][30],pre[N],step[N],c[N],pt[N],Min[N],Max[N];
void extend()
{
for (int i=0;i<n;++i)
{
int x=s[i]-'a';
p=last;np=++sz;last=np;
step[np]=step[p]+1;
while (p&&!ch[p][x])
{
ch[p][x]=np;
p=pre[p];
}
if (!p) pre[np]=root;
else
{
q=ch[p][x];
if (step[q]==step[p]+1) pre[np]=q;
else
{
nq=++sz;
step[nq]=step[p]+1;
memcpy(ch[nq],ch[q],sizeof(ch[q]));
pre[nq]=pre[q];
pre[q]=pre[np]=nq;
while (ch[p][x]==q)
{
ch[p][x]=nq;
p=pre[p];
}
}
}
}
}
void sam()
{
int len=0;p=root;
memset(Max,0,sizeof(Max));
for (int i=0;i<n;++i)
{
int x=s[i]-'a';
if (ch[p][x]) p=ch[p][x],++len;
else
{
while (p&&!ch[p][x]) p=pre[p];
if (!p) p=root,len=0;
else
{
len=step[p]+1;
p=ch[p][x];
}
}
Max[p]=max(Max[p],len);
}
for (int i=sz;i>=1;--i)
{
p=pt[i];
if (Max[p]) Max[pre[p]]=step[pre[p]];
}
for (int i=1;i<=sz;++i)
Min[i]=min(Min[i],Max[i]);
}
int main()
{
scanf("%d",&T);--T;
scanf("%s",s);n=strlen(s);
root=last=++sz;
extend();
for (int i=1;i<=sz;++i) ++c[step[i]];
for (int i=1;i<=sz;++i) c[i]+=c[i-1];
for (int i=sz;i>=1;--i) pt[c[step[i]]--]=i;
memset(Min,127,sizeof(Min));inf=Min[0];
while (T--)
{
scanf("%s",s);n=strlen(s);
sam();
}
for (int i=1;i<=sz;++i)
if (Min[i]!=inf) ans=max(ans,Min[i]);
printf("%d\n",ans);
}