HDU2328 Corporate Identity（KMP）

题意：给n个串，求最大公共子串，要求字典序最小。

思路：数据量小，暴力枚举子串，KMP匹配即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const int maxn = 205;
typedef long long ll;
void get_next(char s[], int next[]){
    int len = strlen(s);
    next[0] = -1;
    int index;
    for(int i=1; i<len; ++i){
        index = next[i - 1];
        while(index >= 0 && s[i] != s[index + 1]){
            index = next[index];
        }
        if(s[i] == s[index + 1]){
            next[i] = index + 1;
        } else {
            next[i] = -1;
        }
    }
}
int KMP(char target[], char pattern[]){
    int len1 = strlen(target);
    int len2 = strlen(pattern);
    int next[maxn];
    get_next(pattern, next);
    int i = 0, j = 0;
    while(i < len1 && j < len2){
        if(target[i] == pattern[j]){
            ++i;
            ++j;
        } else if(j == 0){
            ++i;
        } else {
            j = next[j - 1] + 1;
        }
    }
    if(j == len2){
        return i - j;
    } else {
        return -1;
    }
}
char str[4005][201];
int main(){
    int n, k;
    char s1[205], ans[205];
    while(scanf("%d", &n) && n){
        int pos = 0, MIN = inf;
        int f = 0;
        for(int i=0; i<n; ++i){
            scanf("%s", str[i]);
            int len = strlen(str[i]);
            if(len < MIN){
                MIN = len;
                pos = i;
            }
        }
        for(int i=MIN; i>0 && !f; --i){//枚举子串长度，从大开始
            for(int j=0; j+i<=MIN; ++j){//枚举子串起点
                for(k=0; k<i; ++k){//生成子串
                    s1[k] = str[pos][k + j];
                }
                s1[i] = 0;
                for(k=0; k<n; ++k){//匹配
                    if(KMP(str[k], s1) == -1){
                        break;
                    }
                }
                if(k == n){
                    if(!f){
                        strcpy(ans, s1);
                        f = 1;
                    } else if(f && strcmp(ans, s1) > 0){//字典序最小
                        strcpy(ans, s1);
                    }
                }
            }
        }
        if(f){
            puts(ans);
        } else {
            puts("IDENTITY LOST");
        }
    }
    return 0;
}