POJ 2774 Long Long Message 后缀数组模板题

　　题意

　　　　　　给定字符串A、B，求其最长公共子串

　　后缀数组模板题，求出height数组，判断sa[i]与sa[i-1]是否分属字符串A、B，统计答案即可。

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

using namespace std;

const int maxn = ;
char str[maxn];
int num[maxn];
int wa[maxn], wb[maxn], wv[maxn], sum[maxn];
int rank[maxn], sa[maxn], height[maxn];

bool cmp(int *r, int a, int b, int l)
{
    return (r[a] == r[b]) && (r[a+l] == r[b+l]);
}

void da(int *r, int *sa, int n, int m)
{
    int *x = wa, *y = wb, *t;
    for (int i = ; i <= m; ++i)
        sum[i] = ;
    for (int i = ; i <= n; ++i)
        sum[x[i]=r[i]] ++;
    for (int i = ; i <= m; ++i)
        sum[i] += sum[i-];
    for (int i = n; i >= ; --i)
        sa[sum[x[i]]--] = i;
    for (int i, j = , p = ; p < n; j *= , m = p)
    {
        for (p = , i = n-j+; i <= n; ++i)
            y[++p] = i;
        for (i = ; i <= n; ++i)
            if (sa[i]-j >= )
                y[++p] = sa[i]-j;
        for (i = ; i <= n; ++i)
            wv[i] = x[y[i]];
        for (i = ; i <= m; ++i)
            sum[i] = ;
        for (i = ; i <= n; ++i)
            sum[wv[i]] ++;
        for (i = ; i <= m; ++i)
            sum[i] += sum[i-];
        for (i = n; i >= ; --i)
            sa[sum[wv[i]]--] = y[i];
        for (t = x, x = y, y = t, p = , x[sa[]] = , i = ; i <= n; ++i)
            x[sa[i]] = cmp(y, sa[i], sa[i-], j) ? p : ++p;
    }/*
    for (int i = 1; i <= n; ++i)
        printf("%d ", sa[i]);
    printf("\n");*/
}

void calheight(int *r, int *sa, int n)
{
    for (int i = ; i <= n; ++i)
        rank[sa[i]] = i;/*
    for (int i = 1; i <= n; ++i)
        printf("%d ", rank[i]);
    printf("\n");*/
    int k = ;
    for (int i = ; i <= n; ++i)
    {
        if (k > )
            k --;
        int j = sa[rank[i]-];
        while (r[i+k] == r[j+k] && i+k <= n && j+k <= n)
            k ++;
        height[rank[i]] = k;
    }
}

int main()
{
    scanf("%s", str);
    int l1 = strlen(str);
    for (int i = ; i <= l1; ++i)
        num[i] = str[i-]-'a'+;
    num[l1+] = ;
    scanf("%s", str);
    int l2 = strlen(str);
    for (int i = ; i <= l2; ++i)
        num[l1++i] = str[i-]-'a'+;
    da(num, sa, l1+l2+, );
    calheight(num, sa, l1+l2+);
    int ans = ;
    for (int i = ; i <= l1+l2+; ++i)
        if ((sa[i] <= l1 && sa[i-] >= l1+)
         || (sa[i-] <= l1 && sa[i] >= l1+))
            ans = max(ans, height[i]);
    printf("%d\n", ans);
    return ;
}