【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=;i<m;i++) ws[i]=;
     for (i=;i<n;i++) ws[x[i]=r[i]]++;
     for (i=;i<m;i++) ws[i]+=ws[i-];
     for (i=n-;i>=;i--) sa[--ws[x[i]]]=i;
     for (j=,p=;p<n;j<<=,m=p)
     {
         for (p=,i=n-j;i<n;i++) y[p++]=i;
         for (i=;i<n;i++) if (sa[i]>=j) y[p++]=sa[i]-j;
         for (i=;i<n;i++) wv[i]=x[y[i]];
         for (i=;i<m;i++) ws[i]=;
         for (i=;i<n;i++) ws[wv[i]]++;
         for (i=;i<m;i++) ws[i]+=ws[i-];
         for (i=n-;i>=;i--) sa[--ws[wv[i]]]=y[i];
         for (t=x,x=y,y=t,p=,x[sa[]]=,i=;i<n;i++)
             x[sa[i]]=cmp(y,sa[i-],sa[i],j) ? p- : p++;
     }
     return ;
 }

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

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