【tyvj1860】后缀数组

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cstdlib>
 5 #include<set>
 6 #include<ctime>
 7 #include<vector>
 8 #include<cmath>
 9 #include<algorithm>
10 #include<map>
11 #define inf 2000000000
12 #define N 200005
13 int n;
14 char ch[N];
15 int a[N],h[N];
16 int v[N];
17 int sa[2][N],rk[2][N];
18 int p,q,k;
19 void init(){
20     scanf("%s",ch+1);
21     n=strlen(ch+1);
22     for (int i=1;i<=n;i++) a[i]=ch[i]-‘a‘+1;
23 }
24 
25 void change(int sa[N],int rk[N],int SA[N],int RK[N]){
26     for (int i=1;i<=n;i++) v[rk[sa[i]]]=i;//该排名最后出现的位置
27     for (int i=n;i>=1;i--) if (sa[i]>k)
28         SA[v[rk[sa[i]-k]]--]=sa[i]-k;//?
29     for (int i=n-k+1;i<=n;i++) SA[v[rk[i]]--]=i;//?
30     for (int i=1;i<=n;i++)  RK[SA[i]]=RK[SA[i-1]]+(rk[SA[i-1]]!=rk[SA[i]]||rk[SA[i-1]+k]!=rk[SA[i]+k]);
31     
32 }
33 
34 void work(){
35      q=1,p=0;
36     for (int i=1;i<=n;i++) v[a[i]]++;
37     for (int i=1;i<=26;i++)v[i]+=v[i-1];
38     for (int i=1;i<=n;i++) sa[p][v[a[i]]--]=i;
39     for (int i=1;i<=n;i++) rk[p][sa[p][i]]=(rk[p][sa[p][i-1]])+(a[sa[p][i-1]]!=a[sa[p][i]]);
40     k=1;
41     while (k<n){
42         change(sa[p],rk[p],sa[q],rk[q]);
43         p^=1;q^=1;k=k<<1;
44     }
45     for (int i=1;i<=n;i++) printf("%d ",sa[p][i]);
46 }
47 
48 void geth(){
49     int k=0;
50     for (int i=1;i<=n;i++)
51     if (rk[p][i]==1)h[rk[p][i]]=0;
52     else{
53         int j=sa[p][rk[p][i]-1];
54         while (a[i+k]==a[j+k])k++;
55         h[rk[p][i]]=k;if (k>0)k--;
56     }
57 }
58 
59 int main(){
60     init();
61     work();
62     geth();
63     puts("");
64     for(int i=1;i<=n;i++)printf("%d ",h[i]);
65 }