【uoj35】后缀排序

后缀数组模板题

#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;

#define N 100010

int wa[N],wb[N],ws[N],wv[N];
int sa[N],rank[N],height[N];
int r[N];
char s[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 n,int m)
{
    int i,j,p,*x=wa,*y=wb,*t;
    for (i=0;i<m;i++) ws[i]=0;
    for (i=0;i<n;i++) ws[x[i]=r[i]]++;
    for (i=1;i<m;i++) ws[i]+=ws[i-1];
    for (i=n-1;i>=0;i--) sa[--ws[x[i]]]=i;
    for (j=1,p=1;p<n;j<<=1,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++) ws[i]=0;
        for (i=0;i<n;i++) ws[wv[i]]++;
        for (i=1;i<m;i++) ws[i]+=ws[i-1];
        for (i=n-1;i>=0;i--) sa[--ws[wv[i]]]=y[i];
        for (t=x,x=y,y=t,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++;
    }
    return ;
}

void calheight(int *r,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++);
    return ;
}

int main()
{
    scanf("%s",s);
    int n=strlen(s);
    for (int i=0;i<n;i++)
        r[i]=s[i]-'a'+2;
    r[n]=0;
    da(r,n+1,30);
    calheight(r,n);
    for (int i=1;i<=n;i++)
        printf("%d ",sa[i]+1);
    printf("
");
    for (int i=2;i<=n;i++)
        printf("%d ",height[i]);
    return 0;
}