后缀数组模板

m=字符类型上限+1，ch[n]=0 

int n;
char s[maxn];
int ch[maxn];
int Sa[maxn];
int Rank[maxn];
int Height[maxn];
int t1[maxn],t2[maxn],c[maxn];

bool cmp( int *r , int a , int b , int l )
{
    return r[a]==r[b]&&r[a+l]==r[b+l];
}

void SA( int m )
{
    n++; int *x=t1,*y=t2;
    for ( int i=0 ; i<m ; i++ ) c[i] = 0;
    for ( int i=0 ; i<n ; i++ ) c[x[i]=ch[i]]++;
    for ( int i=1 ; i<m ; i++ ) c[i] += c[i-1];
    for ( int i=n-1 ; i>=0 ; i-- ) Sa[--c[x[i]]] = i;
    for ( int j=1,p ; j<=n ; j<<=1 )
    {
        p = 0;
        for ( int i=n-j ; i<n ; i++ ) y[p++] = i;
        for ( int i=0 ; i<n ; i++ ) if ( Sa[i]>=j ) y[p++] = Sa[i]-j;
        for ( int i=0 ; i<m ; i++ ) c[i] = 0;
        for ( int i=0 ; i<n ; i++ ) c[x[y[i]]]++;
        for ( int i=1 ; i<m ; i++ ) c[i] += c[i-1];
        for ( int i=n-1 ; i>=0 ; i-- ) Sa[--c[x[y[i]]]] = y[i];
        swap ( x , y );
        p = 1;
        x[Sa[0]] = 0;
        for ( int i=1 ; i<n ; i++ )
            x[Sa[i]] = cmp( y , Sa[i-1] , Sa[i] , j )?p-1:p++;
        if ( p>=n ) break;
        m = p;
    }
    int l = 0;
    n--;
    for ( int i=0 ; i<=n ; i++ ) Rank[Sa[i]] = i;
    for ( int i=0 ; i< n ; i++ )
    {
        if ( l ) l--;
        int j = Sa[Rank[i]-1];
        while ( ch[i+l]==ch[j+l] ) l++;
        Height[Rank[i]] = l;
    }
}