Long Long Message POJ - 2774 （后缀数组求最长公共子串）

题目 https://cn.vjudge.net/problem/POJ-2774

题意

给你两串字符，要你找出在这两串字符中都出现过的最长子串

思路

先用个分隔符将两个字符串连接起来，再用后缀数组求出height数组的值，找出一个height值最大并且i与i-1的sa值分别在两串字符中就好了

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
const int maxn = 200010;
int cntA[maxn],cntB[maxn],sa[maxn],tsa[maxn],A[maxn],B[maxn],height[maxn];
int Rank[maxn];
ll n;
char ch[maxn];
void solve()
{
    for(int i = 0;i < 256;i++) cntA[i] = 0;
    for(int i = 1;i <= n;i++) cntA[ch[i-1]]++;
    for(int i = 1;i < 256;i++) cntA[i] += cntA[i-1];
    for(int i = n;i;i--) sa[cntA[ch[i-1]]--] = i;

    Rank[sa[1]] = 1;
    for(int i = 2;i <= n;i++)
    {
        Rank[sa[i]] = Rank[sa[i-1]];
        if(ch[sa[i]-1] != ch[sa[i-1]-1]) Rank[sa[i]]++;
    }

    for(int l = 1;Rank[sa[n]] < n;l <<= 1)
    {
        memset(cntA,0,sizeof(cntA));
        memset(cntB,0,sizeof(cntB));
        for(int i = 1;i <= n;i++)
        {
            cntA[A[i] = Rank[i]]++;
            cntB[B[i] = (i+l <= n)?Rank[i+l]:0]++;
        }
        for(int i = 1;i <= n;i++) cntB[i] += cntB[i-1];
        for(int i = n;i; i--) tsa[cntB[B[i]]--] = i;
        for(int i = 1;i <= n;i++) cntA[i] += cntA[i-1];
        for(int i = n; i;i--) sa[cntA[A[tsa[i]]]--] = tsa[i];

        Rank[sa[1]] = 1;
        for(int i = 2;i <= n;i++)
        {
            Rank[sa[i]] = Rank[sa[i-1]];
            if(A[sa[i]] != A[sa[i-1]] || B[sa[i]] != B[sa[i-1]]) Rank[sa[i]]++;
        }

    }
    for(int i = 1,j = 0;i <= n;i++)
    {
        if(j) j--;
        while(ch[i+j-1] == ch[sa[Rank[i]-1] + j - 1]) j++;
        height[Rank[i]] = j;
    }
}
char s1[maxn],s2[maxn];
int main()
{

        scanf("%s", s1);
        scanf("%s", s2);
        int len1 = strlen(s1);
        int len2 = strlen(s2);
        for(int i = 0;i < len1;i++)
        {
            ch[i] = s1[i];
        }
        ch[len1] = '#';
        for(int i = len1+1;i < len1+len2+1;i++)
        {
            ch[i] = s2[i-len1-1];
        }
        ch[len1+len2+1] = '\0';
        n = len1+len2+1;
        solve();
//        for(int i = 1;i <= len1+len2+1;i++)
//        {
//            printf("%d %d %d\n",sa[i-1],sa[i],height[i]);
//        }
        int ans = 0;
        for(int i = 1;i <= len1+len2+1;i++)
        {
            if(sa[i-1] < len1 && sa[i] > len1)
                ans = max(ans,height[i]);
            if(sa[i-1] > len1 && sa[i] < len1)
                ans = max(ans,height[i]);
        }
        printf("%d\n",ans);

}