可重叠重复字串[后缀数组]

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
const int N = 100000 + 11;
using namespace std;
int wb[N],wv[N],wss[N],R[N],Rank[N],Sa[N];
char ss[N];

int 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 i,j,p,*x = Rank,*y = wb,*it;
    for(i = 0;i < m; ++i) wss[i] = 0;
    for(i = 0; i < n; ++i) ++wss[x[i]=r[i]];
    for(i = 1; i < m; ++i) wss[i] += wss[i-1];
    for(i = n-1; i >= 0; --i) sa[--wss[x[i]]] = i; // always forget
    for(j = 1, p = 1; p < n; j *= 2, m = p)
    {
        for(p = 0,i = n - j; i < n; ++i) y[p++] = i;
        for(i = 0; i < n; ++i) if(sa[i] >= j) y[p++] = sa[i] - j;
        for(i = 0; i < n; ++i) wv[i] = x[y[i]];
        for(i = 0; i < m; ++i) wss[i] = 0;
        for(i = 0; i < n; ++i) ++wss[wv[i]];
        for(i = 1; i < m; ++i) wss[i] += wss[i-1];
        for(i = n-1; i >= 0; i--) sa[--wss[wv[i]]] = y[i];
        for(it = x,x = y,y = it,p = 1, x[sa[0]] = 0, i = 1; i < n; ++i)
        x[sa[i]] = cmp(y,sa[i-1],sa[i],j)?p-1:p++;

    }
}

int rank[N], height[N];
void cal_height(int *r,int *sa,int n)
{
    int i,j,k = 0;
    for(i = 1; i <= n; ++i) rank[sa[i]] = i;
    for(i = 0; i < n; height[rank[i++]] = k)
    for(k?k--:0,j = sa[rank[i]-1]; r[i+k] == r[j+k];++k);
}

void Solve(int l)
{
    int maxx = 0, ans = 0;
    for(int i = 1; i <= l; ++i)
        if(height[i] > maxx) maxx = height[i], ans = i;
    int id = Sa[ans]; 
    for(int i = 0; i < maxx; ++i)
    {
        printf("%c",ss[id+i]);
    }
}

int main()
{
    scanf("%s",ss); int l = strlen(ss);
    for(int i = 0; i < l; ++i) R[i] = ss[i]; R[l] = 0;
    Da(R,Sa,l+1,130);
    cal_height(R,Sa,l);
    Solve(l);
        
    return 0;
}