传送门biu~
后缀自动机模板题。
#include<bits/stdc++.h>
using namespace std;
const int INF=1e9;
struct Node{
Node *fa,*ch[26];
int val,len[6];
Node(int _=0){
val=_;
fa=NULL;
memset(ch,0,sizeof(ch));
memset(len,0,sizeof(len));
}
}*root,*last;
void extend(char c){
int z=c-'a';
Node *p=last,*np=new Node(p->val+1);
last=np;
while(p && !p->ch[z]) p->ch[z]=np,p=p->fa;
if(!p){
np->fa=root;
return;
}
Node* q=p->ch[z];
if(q->val==p->val+1){
np->fa=q;
return;
}
Node *nq=new Node(p->val+1);
memcpy(nq->ch,q->ch,sizeof(q->ch));
nq->fa=q->fa;
q->fa=np->fa=nq;
while(p && p->ch[z]==q) p->ch[z]=nq,p=p->fa;
}
void init(char s[]){
root=last=new Node;
int len=strlen(s+1);
for(int i=1;i<=len;++i) extend(s[i]);
}
void match(char s[],int x){
int len=strlen(s+1),match_len=0;
Node *o=root;
for(int i=1;i<=len;++i){
int z=s[i]-'a';
while(o!=root && !o->ch[z]) o=o->fa,match_len=o->val;
if(o->ch[z]) ++match_len,o=o->ch[z];
Node *tmp=o;
while(tmp){
tmp->len[x]=max(tmp->len[x],min(match_len,tmp->val));
tmp=tmp->fa;
}
}
}
int n,ans;
void find_ans(Node *o){
int tmp=INF;
for(int i=2;i<=n;++i) tmp=min(tmp,o->len[i]);
ans=max(ans,tmp);
for(int i=0;i<26;++i)
if(o->ch[i]) find_ans(o->ch[i]);
}
char s[6][2005];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%s",s[i]+1);
init(s[1]);
for(int i=2;i<=n;++i) match(s[i],i);
find_ans(root);
printf("%d",ans);
return 0;
}