linux下面输出不打换行他还输出不出来也是溜
extend里面打错了还过样例...
先对第一个串建立后缀自动机
然后对于读入的每一个串的每一个位置开头的字串在自动机上进行匹配
记录自动机上每一个节点对于该串的最大匹配长度
最后再DFS一遍统计答案就可以了
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#define SF scanf
#define PF printf
#define idx(c) (c-'a')
using namespace std;
typedef long long LL;
const int MAXN = 2000;
const int INF = 0x3f3f3f3f;
int n, ans;
char s[MAXN+10];
struct SAM {
int ncnt, last;
int fa[MAXN*2+10], ch[MAXN*2+10][26], step[MAXN*2+10];
int MIN[MAXN*2+10][6], vis[MAXN*2+10];
SAM() { last = ++ncnt; }
void extend(int c) {
int p = last, np = last = ++ncnt;
step[np] = step[p]+1;
while(!ch[p][c] && p) ch[p][c] = np, p = fa[p];
if(!p) fa[np] = 1;
else {
int q = ch[p][c], nq;
if(step[q] == step[p]+1) fa[np]= q;
else {
nq = ++ncnt;
step[nq] = step[p]+1;
memcpy(ch[nq], ch[q], sizeof(ch[q]));
fa[nq] = fa[q];
fa[q] = fa[np] = nq;
while(ch[p][c] == q) ch[p][c] = nq, p = fa[p];
MIN[nq][1] = step[nq];
}
}
MIN[np][1] = step[np];
}
void build(char *s) {
int len = strlen(s);
for(int i = 0; i < len; i++)
extend(idx(s[i]));
}
void dfs(int u) {
vis[u] = true;
int ret = INF;
for(int i = 1; i <= n; i++) ret = min(ret, MIN[u][i]);
ret = min(ret, step[u]);
ans = max(ans, ret);
for(int i = 0; i < 26; i++)
if(ch[u][i] && !vis[ch[u][i]])
dfs(ch[u][i]);
}
} sam;
int main() {
SF("%d", &n);
SF("%s", s);
sam.build(s);
for(int i = 2; i <= n; i++) {
SF("%s", s);
int p = 1, len = 0;
for(int j = 0; s[j]; j++) {
int c = idx(s[j]);
while(p && !sam.ch[p][c]) p = sam.fa[p], len = sam.step[p];
if(p == 0) p = 1;
else len++, p = sam.ch[p][c];
for(int k = p; k; k = sam.fa[k])
sam.MIN[k][i] = max(sam.MIN[k][i], min(len, sam.step[k]));
}
}
sam.dfs(1);
printf("%d\n", ans);
return 0;
}
/*
3
abcb
bca
acbc
*/