后缀数组模板

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
using namespace std;
const int maxn=1e5+5,sigma_size=128;
char s[maxn];
int n,m;
int t1[maxn],t2[maxn],c[maxn],sa[maxn]；
int rank[maxn],height[maxn];
inline void da(char *r,int n,int m) {
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]=r[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 p,k=1;k<=n&&p<n;k<<=1,m=p) {
p=0;
for (int i=n-k;i<n;++i) y[p++]=i;
for (int i=0;i<n;++i) if (sa[i]>=k) y[p++]=sa[i]-k;
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]]=(y[sa[i]]==y[sa[i-1]]&&y[sa[i]+k]==y[sa[i-1]+k])?p-1:p++;
}
}
inline void getheight(char *r,int n) {
int k=0,j;
for (int i=1;i<=n;++i) rank[sa[i]]=i;
for (int i=0;i<n;height[rank[i++]]=k)
for (k?k--:0,j=sa[rank[i]-1];r[i+k]==r[j+k];++k);
}
inline void debug() {
for (int i=1;i<=n;++i)
cout<<sa[i]<<' ';
cout<<endl;
}
int main() {
scanf("%s",s);
n=strlen(s);
da(s,n+1,sigma_size);
getheight(s,n);
//  debug();
return 0;
}