poj3450 Corporate Identity kmp || 后缀数组

题目：

http://poj.org/problem?id=3450

题意：

给定n个字符串，求这n个字符串的最长公共子串

思路：

比较优的解法是枚举答案，然后用kmp或者strstr函数去判定枚举的子串是否是剩余所有字符串的子串。用后缀数组也可以，但是比较慢
kmp:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 4000 + 10, M = 300 + 10;

int Next[M];
char str[N][M];

void get_next(char *pat)
{
    int i = 0, j = -1;
    Next[0] = -1;
    while(pat[i])
    {
        if(j == -1 || pat[i] == pat[j]) Next[++i] = ++j;
        else j = Next[j];
    }
}
bool kmp(char *ori, char *pat, int pat_len)
{
    get_next(pat);
    int i = 0, j = 0;
    while(ori[i])
    {
        if(j == -1 || ori[i] == pat[j]) ++i, ++j;
        else j = Next[j];
        if(j == pat_len) return true;
    }
    return false;
}
bool check(int st, int en, char *pat, int pat_len)
{
    for(int i = st; i <= en; i++)
        if(! kmp(str[i], pat, pat_len)) return false;
    return true;
}
bool cmp(char *ori, char *pat, int len)
{
    for(int i = 0; i < len; i++)
        if(ori[i] > pat[i]) return true;
        else if(ori[i] < pat[i]) return false;
    return false;
}
int main()
{
    int n;
    while(scanf("%d", &n), n)
    {
        for(int i = 0; i < n; i++) scanf("%s", str[i]);
        int ans_id = -1, ans_len = 0;
        int len = strlen(str[0]);
        for(int i = 0; i < len; i++)
        {
            get_next(str[0] + i);
            int l = 1, r = len - i;
            while(l <= r)
            {
                int mid = (l + r) >> 1;
                if(check(1, n-1, str[0]+i, mid))
                {
                    l = mid + 1;
                    if(mid > ans_len) ans_id = i, ans_len = mid;
                    else if(mid == ans_len)
                    {
                        if(cmp(str[0] + ans_id, str[0] + i, ans_len)) ans_id = i;
                    }
                }
                else r = mid - 1;
            }
        }
        if(ans_id == -1) printf("IDENTITY LOST");
        else for(int i = ans_id; i < ans_id + ans_len; i++) printf("%c", str[0][i]);
        printf("\n");
    }
    return 0;
}

strstr:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 4000 + 10, M = 200 + 10;

char str[N][M];
char s[M], res[M];
int main()
{
    int n;
    while(scanf("%d", &n), n)
    {
        for(int i = 0; i < n; i++) scanf("%s", str[i]);
        int len = -1;
        for(int i = 0; str[0][i]; i++)
            for(int j = i; str[0][j]; j++)
            {
                if(j-i+1 < len) continue;
                memset(s, 0, sizeof s);
                for(int k = i; k <= j; k++)
                    s[k-i] = str[0][k];
                bool flag = true;
                for(int k = 1; k < n; k++)
                    if(! strstr(str[k], s))
                    {
                        flag = false; break;
                    }
                if(flag)
                {
                    if(j-i+1 > len)
                    {
                        len = j-i+1;
                        memcpy(res, s, sizeof s);
                    }
                    else if(j-i+1 == len)
                    {
                        if(strcmp(res, s) == 1) memcpy(res, s, sizeof s);
                    }
                }
            }
        if(len == -1) printf("IDENTITY LOST\n");
        else printf("%s\n", res);
    }
    return 0;
}

后缀数组：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 800000 + 10, M = 5000 + 10, INF = 0x3f3f3f3f;

int sa[N], height[N], rnk[N], wa[N], wb[N], c[N];
char str[M], str_ans[M];
int s[N], loc[N];
bool vis[M];

bool cmp(int *r, int a, int b, int l)
{
    return r[a] == r[b] && r[a+l] == r[b+l];
}
void Rsort(int *x, int *y, int n, int m)
{
    for(int i = 0; i < m; i++) c[i] = 0;
    for(int i = 0; i < n; i++) c[x[y[i]]]++;
    for(int i = 1; i < m; i++) c[i] += c[i-1];
    for(int i = n-1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
}
void da(int *s, int n, int m)
{
    int *x = wa, *y = wb;
    for(int i = 0; i < n; i++) x[i] = s[i], y[i] = i;
    Rsort(x, y, n, m);
    for(int j = 1, p = 1; p < n; j *= 2, m = p)
    {
        p = 0;
        for(int i = n-j; i < n; i++) y[p++] = i;
        for(int i = 0; i < n; i++) if(sa[i] >= j) y[p++] = sa[i] - j;
        Rsort(x, y, n, m);
        swap(x, y); p = 1; x[sa[0]] = 0;
        for(int i = 1; i < n; i++) x[sa[i]] = cmp(y, sa[i-1], sa[i], j) ? p-1 : p++;
    }
}
void get_height(int *s, int n)
{
    int i, j, k = 0;
    for(i = 0; i <= n; i++) rnk[sa[i]] = i;
    for(i = 0; i < n; height[rnk[i++]] = k)
        for(k ? --k : 0, j = sa[rnk[i]-1]; s[i+k] == s[j+k]; k++);
}
bool check(int k, int len, int n)
{
    int tot = 0;
    memset(vis, 0, sizeof vis);
    for(int i = 2; i <= len; i++)
    {
        if(height[i] < k)
        {
            tot = 0;
            memset(vis, 0, sizeof vis);
        }
        else
        {
            if(! vis[loc[sa[i-1]]]) vis[loc[sa[i-1]]] = true, tot++;
            if(! vis[loc[sa[i]]]) vis[loc[sa[i]]] = true, tot++;
        }
        if(tot == n)
        {
            int cnt = 0;
            for(int j = sa[i]; j < sa[i]+k; j++) str_ans[cnt++] = s[j] - 1 + 'a';
            str_ans[cnt] = '\0';
            return true;
        }
    }
    return false;
}
int main()
{
    int n;
    while(scanf("%d", &n), n)
    {
        int len = 0, t = 30;
        for(int i = 1; i <= n; i++)
        {
            scanf("%s", str);
            for(int j = 0; str[j]; j++) loc[len] = i, s[len++] = str[j]-'a'+1;
            loc[len] = t, s[len++] = t++;
        }
        s[len] = 0;
        da(s, len+1, t);
        get_height(s, len);
        int l = 1, r = 200;
        bool flag = false;
        while(l <= r)
        {
            int mid = (l + r) >> 1;
            if(check(mid, len, n))
            {
                l = mid + 1;
                flag = true;
            }
            else r = mid - 1;
        }
        if(flag) puts(str_ans);
        else puts("IDENTITY LOST");
    }
    return 0;
}