Longest Common Substring

HDU 1403



经典的后缀数组题目，把两个字符串合并，维护一下后缀数组就好了

#include <bits/stdc++.h>
using namespace std;

const int maxn = 200010;
char ch[maxn], All[maxn];
int SA[maxn], Rank[maxn], Height[maxn], tax[maxn], tp[maxn], a[maxn];
int len, n, m, ans;
char str[maxn];

void RSort() {
    for (int i = 0; i <= m; i++) tax[i] = 0;
    for (int i = 1; i <= n; i++) tax[Rank[tp[i]]]++;
    for (int i = 1; i <= m; i++) tax[i] += tax[i-1];
    for (int i = n; i >= 1; i--) SA[tax[Rank[tp[i]]]--] = tp[i];
}

int cmp(int *f, int x, int y, int w) {
    return f[x] == f[y] && f[x+w] == f[y+w];
}

void Suffix() {
    for (int i = 1; i <= n; i++) Rank[i] = a[i], tp[i] = i;
    m = 127, RSort();
    for (int w = 1, p = 1, i; p < n; w += w, m = p) {
        for (p = 0, i = n-w+1; i <= n; i++) tp[++p] = i;
        for (i = 1; i <= n; i++) if (SA[i] > w) tp[++p] = SA[i]-w;

        RSort();
        swap(Rank, tp);
        Rank[SA[1]] = p = 1;

        for (i = 2; i <= n; i++) Rank[SA[i]] = cmp(tp, SA[i], SA[i-1], w) ? p : ++p;
    }
    int j, k = 0;
    for (int i = 1; i <= n; Height[Rank[i++]] = k)
        for (k = k ? k-1: k, j = SA[Rank[i]-1]; a[i+k] == a[j+k]; ++k);
}

void init() {
    //scanf("%s", str);
    n = strlen(str);
    for (int i = 0; i < n; i++) a[i+1] = str[i];
    scanf("%s", str);
    len = strlen(str);
    for (int i = 0; i < len; i++) a[i+n+1] = str[i];
    n = n+len;
    len = n-len;
}

int main() {
    //freopen("input.txt","r",stdin);
    //init();
    while (scanf("%s", str) != EOF) {
        init();
        Suffix();
        ans = 0;
        for (int i = 2; i <= n; i++) {
            if ((SA[i] <= len && SA[i-1] > len) || (SA[i] > len && SA[i-1] <= len)) {
                ans = max(ans, Height[i]);
            }
        }
        printf("%d\n", ans);
    }
}