类型:KMP
题目:给定n个字符串,求最长的公共子串,如果不唯一,输出字典序最小的串
思路:以第一个串的子串为模式串,从大到小枚举串的长度,依次和其他串匹配,如果都匹配成功,将该长度下字典序最小的子串输出
// poj 3450 Corporate Identity
// tle tle ac 332K 1032MS
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
using namespace std;
#define FOR(i,a,b) for(i = (a); i < (b); ++i)
#define CLR(a, b) memset(a, b, sizeof(a))
#define FORE(i,a,b) for(i = (a); i <= (b); ++i)
#define FORDE(i,a,b) for(i = (a); i >= (b); --i)
const int MAXN = 210;
const int INF = 0x7f7f7f7f;
char st[210], sp[210], tmp[4010][210];
char end[210];
int m, len, n, num;
int maxlen;
int p[MAXN];
void next() {
int k = 0, i;
p[1] = 0;
FORE(i, 2, m) {
while(k > 0 && sp[i] != sp[k + 1])
k = p[k];
if(sp[k + 1] == sp[i])
k = k + 1;
p[i] = k;
}
}
int kmp() {
int k = 0, i;
FORE(i, 1, len) {
while(k > 0 && st[i] != sp[k + 1])
k = p[k];
if(sp[k + 1] == st[i])
k = k + 1;
if(k == m) {
return 1;
k = p[k];
}
}
return 0;
}
int main() {
int i, j, k;
while(scanf("%d", &num) == 1, num) {
FOR(i, 0, num)
scanf("%s", tmp[i] + 1);
bool sign = false;
int tmp_len = strlen(tmp[0] + 1);
FORDE(i, tmp_len, 1) {
FORE(j, 1, tmp_len - i + 1) {
memset(sp, '\0', sizeof(sp));
strncpy(sp + 1, tmp[0] + j, i);
m = strlen(sp + 1);
CLR(p, 0);
next();
FOR(k, 1, num) {
memset(st, '\0', sizeof(st));
strcpy(st + 1, tmp[k] + 1);
len = strlen(tmp[k] + 1);
if(kmp() == 0)
break;
}
if(k >= num) {
if(!sign) {
sign = true;
strcpy(end + 1, sp + 1);
}
if(strcmp(sp + 1, end + 1) == -1)
strcpy(end + 1, sp + 1);
}
}
if(sign)
break;
}
if(!sign)
printf("IDENTITY LOST\n");
else
printf("%s\n", end + 1);
}
return 0;
}