后缀数组

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define F(i,j,n) for(int i=j;i<=n;i++)
#define D(i,j,n) for(int i=j;i>=n;i--)
#define ll long long
#define ull unsigned long long
#define maxn 600005
#define inf 1000000000
using namespace std;
int n,r[maxn],cnt[maxn],x[maxn],y[maxn],sa[maxn],rank[maxn],h[maxn],p[maxn],f[maxn][20],lg2[maxn];
ll ans;
char s[maxn];
void SA(int n,int m)
{

    F(i,0,m-1) cnt[i]=0;
   	F(i,0,n-1) cnt[x[i]=r[i]]++;
    F(i,1,m-1) cnt[i]+=cnt[i-1];
    D(i,n-1,0)  sa[--cnt[x[i]]]=i;

    for(int j=1,p=1;p<n;j<<=1,m=p)
     {
        p=0;
        F(i,n-j,n-1) y[p++]=i;
        F(i,0,n-1) if(sa[i]>=j) y[p++]=sa[i]-j;
        F(i,0,m-1)   cnt[i]=0;
        F(i,0,n-1)   cnt[x[y[i]]]++;
        F(i,1,m-1) 	cnt[i]+=cnt[i-1];
        D(i,n-1,0) sa[--cnt[x[y[i]]]]=y[i];
        swap(x,y);
        x[sa[0]]=0;p=1;
        F(i,1,n-1)
        x[sa[i]]=((y[sa[i]]==y[sa[i-1]])&&(y[sa[i]+j]==y[sa[i-1]+j])) ? p-1:p++;

     }

}
void get_H(int n)
{
    F(i,1,n) rank[sa[i]]=i;
    int j=0,k=0;
    for(int i=0;i<n;h[rank[i++]]=k)
        for(k?k--:0,j=sa[rank[i]-1];r[i+k]==r[j+k];k++);
    return ;    
}

int main()
{
	freopen("后缀数组.in","r",stdin);
	freopen("后缀数组.out","w",stdout);
     scanf("%s",s);
         n=strlen(s);
     F(i,0,n-1) 
         r[i]=s[i]-'a'+1; 
     r[n]=0;
    SA(n+1,28);
    get_H(n);
	return 0; 
}