最长公共子串（后缀数组+LCP)

求两个串的最长公共子串，我们可以将两个串中间插入一个两个串都没有的字符串起来，然后计算出他的后缀数组(sa)和高度数组(lcp)，不在同一串中的sa中相邻后缀的最长公共前缀(即高度数组的最大值)就是两个串的最长公共子串。

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;


const int maxn = 200000+5;
const int oo = 0x3f3f3f3f;
typedef long long ll;
#define FOR(i,n) for(int i=0;i<n;i++)
#define clr(a,x) memset(a,x,sizeof a)

char S[maxn];
char T[maxn];
int ranks[maxn];
int sa[maxn];
int lcp[maxn];
int tmp[maxn];
int k = 0;
int n;
bool compare(int i, int j) {
    if (ranks[i] != ranks[j]) return ranks[i] < ranks[j];
    else {
        int ri = i + k <= n ? ranks[i + k] : -1;
        int rj = j + k <= n ? ranks[j + k] : -1;
        return ri < rj;
    }
}
void calc_sa(char *s,int *sa) {
    for (int i = 0; i <= n; i++) {
        sa[i] = i;
        ranks[i] = i < n ? s[i] : -1;
    }
    for (k = 1; k <= n; k *= 2) {
        sort(sa, sa + n + 1, compare);
        tmp[sa[0]] = 0;
        for (int i = 1; i <= n; i++) {
            tmp[sa[i]] = tmp[sa[i - 1]] + (compare(sa[i - 1], sa[i]) ? 1 : 0);
        }
        for (int i = 0; i <= n; i++) {
            ranks[i] = tmp[i];
        }
    }
}

void calc_lcp(char *s, int *sa, int *lcp) {
    int h = 0;
    lcp[0] = 0;
    for (int i = 0; i <= n; i++) {
        int j = sa[ranks[i] + 1];
        if (h > 0) h--;
        for (; j + h < n&&i + h < n; h++) {
            if (s[j + h] != s[i + h]) break;
        }
        lcp[ranks[i]] = h;
    }
}

void solve() {
    int len = strlen(S);
    int m = strlen(T);
    n = len + m + 1;
    S[len] = '\0';
    for (int i = 0; i < m; i++) {
        S[len + i + 1] = T[i];
    }
    S[m + len + 1] = 0;
    int ans = 0;
    calc_sa(S, sa);
    calc_lcp(S, sa, lcp);
    for (int i = 0; i < n; i++) {
        if ((sa[i] < len) != (sa[i + 1] < len)) {
            ans = max(ans, lcp[i]);
        }
    }
    printf("%d\n", ans);
}
int main() {
    while (scanf("%s%s", S, T) != EOF) {
        solve();
    }
    return 0;
}