题意:求给出的 n n n个字符串的 l c s lcs lcs,若有多个,输出字典序最小的。
题解:kmp
因为有多个字符串,可以枚举第一个字符串的所有子串,相当于假定这个子串是
l
c
s
lcs
lcs,然后和剩余的字符串跑kmp,都满足就用
s
t
r
c
m
p
(
)
strcmp()
strcmp()比较一下就行。
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#define ll long long
using namespace std;
const int maxn = 222;
int nxt[maxn];
void kmp_pre(char x[], int m, int Next[]) { //下标从0开始
int i, j;
j = Next[0] = -1;
i = 0;
while (i < m) {
while (-1 != j && x[i] != x[j])j = Next[j];
Next[++i] = ++j;
}
}
int KMP_Count(char x[], int m, char y[], int n) {//x 是模式串, y 是主串
int i, j;
int ans = 0;
//preKMP(x,m,Next);
kmp_pre(x, m, nxt);
i = j = 0;
while (i < n) {
while (-1 != j && y[i] != x[j])j = nxt[j];
i++; j++;
if (j >= m) {
ans++;
break;
j = nxt[j];
}
}
return ans;
}
int n;
char s[4444][maxn], ans[maxn];
int main() {
while (~scanf("%d", &n) && n) {
memset(ans, 0, sizeof(ans));
for (int i = 1; i <= n; i++) {
scanf("%s", s[i]);
}
int len = strlen(s[1]), flag = 0;
for (int i = 0; i < len; i++) {
for (int j = 1; i + j <= len; j++) {
char temp[maxn];
for (int k = 0; k < j; k++) {
temp[k] = s[1][i + k];
}
temp[j] = '\0';
int num = 0;
for (int k = 2; k <= n; k++) {
if (KMP_Count(temp, j, s[k], strlen(s[k]))) num++;
else break;
}
if (num == n - 1) {
flag++;
if(flag == 1) strcpy(ans, temp);
else {
if (strlen(temp) == strlen(ans)) {
if (strcmp(temp, ans) < 0) strcpy(ans, temp);
}
else if (strlen(temp) > strlen(ans)) {
strcpy(ans, temp);
}
}
}
}
}
if (flag) printf("%s\n", ans);
else puts("IDENTITY LOST");
}
return 0;
}