2946: [Poi2000]公共串
Time Limit: 3 Sec Memory Limit: 128 MBSubmit: 681 Solved: 285
[ Submit][ Status][ Discuss]
Description
Input
Output
Sample Input
abcb
bca
acbc
Sample Output
2
解题思路:后缀自动机。先对第一个单词建立后缀自动机,然后,后面的单词进行匹配,求得
每个单词对每个点的最长后缀的最小值(因为要公共),然后在求出最大的最小值。
加深对后缀自动机的理解。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,len,last,cnt,pa;
char c[21000];
int fa[21000],mx[21000],ch[21000][27];
int ans[5][21000];
inline int read()
{
char y; int x=0,f=1; y=getchar();
while (y<'0'||y>'9') {if (y=='-') f=-1; y=getchar();}
while (y>='0' && y<='9') {x=x*10+int(y)-48; y=getchar();}
return x*f;
}
void add(int s)
{
int p=last; int np=last=++cnt; mx[np]=mx[p]+1;
while (p&&!ch[p][s]) ch[p][s]=np,p=fa[p];
if (p==0) fa[np]=1;else
{
int q=ch[p][s];
if (mx[q]==mx[p]+1)
{
fa[np]=q;
}else
{
int nq=++cnt; mx[nq]=mx[p]+1;
fa[nq]=fa[q];
fa[np]=fa[q]=nq;
memcpy(ch[nq],ch[q],sizeof(ch[nq]));
while (p!=0&&ch[p][s]==q)ch[p][s]=nq,p=fa[p];
}
}
}
int main()
{
n=read();
scanf("%s",c);
len=strlen(c);
last=cnt=1;
for (int i=1;i<=len;++i)
{
add(c[i-1]-'a');
}
int pa=0;
for (int i=1;i<=n-1;++i)
{
scanf("%s",c);
len=strlen(c);
int tmp=0,now=1;
for (int j=1;j<=len;++j)
{
int s=c[j-1]-'a';
if (ch[now][s])
{
++tmp; now=ch[now][s]; ans[i][now]=max(ans[i][now],tmp);
}else
{
while (now!=0 && ch[now][s]==0) now=fa[now];
if (now==0)
{
now=1; tmp=0;
}else
{
ans[i][now]=max(ans[i][now],mx[now]);
tmp=mx[now]+1; now=ch[now][s]; ans[i][now]=max(ans[i][now],tmp);
}
}
}
}
for (int i=cnt;i>=2;--i)
{
for (int j=1;j<=n-1;++j)
ans[j][fa[i]]=min(mx[fa[i]],max(ans[j][fa[i]],ans[j][i]));
}
for (int i=2;i<=cnt;++i)
{
int jo=0x7fffffff;
for (int j=1;j<=n-1;++j)
jo=min(jo,ans[j][i]);
pa=max(jo,pa);
}
printf("%d\n",pa);
}