POJ 2774 Long Long Message LCP后缀数组

Problem:
给定两个字符串，求两个字符串最长公共子串
Solution:
利用后缀数组求出height数组，然后找到height值，但是要保证两个下标分别在两个字符串当中。

#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<string>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<vector>
#include<fstream>
#include<list>

using namespace std;

//maxn 表示后缀的个数
#define maxn 200010
#define F(x) ((x)/3+((x)%3==1?0:tb))
#define G(x) ((x)<tb?(x)*3+1:((x)-tb)*3+2)

int Ra[maxn], Rb[maxn], Rv[maxn], Rs[maxn];
int c0(int r[], int a, int b){
    return r[a]==r[b] && r[a+1]==r[b+1] && r[a+2]==r[b+2];
}
int c12(int k, int r[], int a, int b){
    if(k==2)
        return r[a]<r[b] || (r[a]==r[b] && c12(1,r,a+1,b+1));
    else
        return r[a]<r[b] || (r[a]==r[b] && Rv[a+1]<Rv[b+1]);
}

//r保存数据，a保存待排序字符下标，b保存3长度字符串的首字符下标，m表示基数的容量，ascii最多128
void Rsort(int r[], int a[], int b[], int n, int m){
    int i;
    for(i = 0; i < n; ++i)  Rv[i] = r[a[i]];//Rv表示待排序字符
    for(i = 0; i < m; ++i)  Rs[i] = 0;//初始化桶
    for(i = 0; i < n; ++i)  ++Rs[Rv[i]];//对应桶自增
    for(i = 1; i < m; ++i)  Rs[i] += Rs[i-1];//使每一个桶都能反映出排名
    for(i = n-1; i >= 0; --i)  b[--Rs[Rv[i]]] = a[i];//按照排名重新存储a
}

void dc3(int r[], int sa[], int n, int m){//n=strlen+1，最后一位补0
    int i, j, *rn = r+n, *san = sa+n, ta=0, tb=(n+1)/3, tbc=0, p;
    r[n] = r[n+1] = 0;
    for(i = 0; i < n; ++i)
        if(i%3!=0)  Ra[tbc++] = i;
    Rsort(r+2, Ra, Rb, tbc, m);
    Rsort(r+1, Rb, Ra, tbc, m);
    Rsort(r, Ra, Rb, tbc, m);
    rn[F(Rb[0])] = 0;  p = 1;
    for(i = 1; i < tbc ; ++i)
        rn[F(Rb[i])] = c0(r, Rb[i-1], Rb[i]) ? p-1 : p++;
    if(p < tbc)
        dc3(rn, san, tbc, p);
    else
        for(i=0;i<tbc;i++)
            san[rn[i]] = i;
    for(i = 0; i < tbc; ++i)
        if(san[i]<tb)
            Rb[ta++] = san[i]*3;
    if(n%3==1)
        Rb[ta++]=n-1;
    Rsort(r, Rb, Ra, ta, m);
    for(i = 0; i < tbc; ++i)
        Rv[Rb[i] = G(san[i])] = i;
    for(i=0,j=0,p=0; i<ta && j<tbc; p++)
        sa[p] = c12(Rb[j]%3, r, Ra[i], Rb[j]) ? Ra[i++] : Rb[j++];
    while(i < ta)
        sa[p++] = Ra[i++];
    while(j < tbc)
        sa[p++] = Rb[j++];
}

int ranks[maxn], height[maxn];//height表示与之前一个的最长公共前缀
void calheight(int r[], int sa[], int n){
    int i, j, k = 0;
    for(i = 1; i <= n; ++i)//sa[0]指到了末尾，排名从1开始
        ranks[sa[i]] = i;
    for(i = 0; i < n; height[ranks[i++]] = k){
        k ? k-- : 0;  j = sa[ranks[i]-1];
        while(r[i+k]==r[j+k])
            ++k;
    }
}
char st[maxn];
int source[maxn*3], sa[maxn*3];
int main(){
//    freopen("D:\\input.txt","r",stdin);
    scanf("%s",st);
    int t1 = strlen(st);
    for(int i = 0; i < t1; ++i)
        source[i] = st[i];
    source[t1] = 1;
    scanf("%s",st);
    int t2 = strlen(st);
    for(int i = 0; i < t2; ++i)
        source[t1+i+1] = st[i];
    source[t1+t2+1] = 0;

    dc3(source, sa, t1+t2+2, 128);
    calheight(source, sa, t1+t2+1);


    int ans = -1;
    for(int i = 1; i <= t1+t2+1; ++i){
        if(height[i] > ans){
            if((sa[i]<t1 && sa[i-1]>t1) || (sa[i]>t1 && sa[i-1]<t1))
                ans = height[i];
        }
    }
    printf("%d\n",ans);

    return 0;
}