代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=2e6+100;
char S[N]={};
int SA[N]={};
int x[N]={};
int y[N]={};
int c[N]={};
int height[N]={};
int rank[N]={};
int n,m;
inline void Get_SA(){
	for(int i=1;i<=n;++i)x[i]=S[i];
	for(int i=1;i<=n;++i)c[x[i]]++;
	for(int i=1;i<=m;++i)c[i]+=c[i-1];
	for(int i=n;i>=1;i--)SA[c[x[i]]--]=i;
	for(int k=1;k<=n;k=k<<1){
		int num=0;
		for(int i=n-k+1;i<=n;++i){
			y[++num]=i;
		}
		for(int i=1;i<=n;++i){
			if(SA[i]>k)y[++num]=SA[i]-k;
		}
		for(int i=1;i<=m;++i)c[i]=0;
		for(int i=1;i<=n;++i)c[x[i]]++;
		for(int i=1;i<=m;++i)c[i]+=c[i-1];
		for(int i=n;i>=1;--i)SA[c[x[y[i]]]--]=y[i],y[i]=0;
		swap(x,y);
		x[SA[1]]=1;
		num=1;
		for(int i=2;i<=n;++i)x[SA[i]]=(y[SA[i]]==y[SA[i-1]]&&y[SA[i]+k]==y[SA[i-1]+k])?num:++num;
		if(num==n)break;
		m=num;
	}
	for(int i=1;i<=n;i++)cout<<SA[i]<<" ";
	cout<<'\n';
}
void Get_Height(){
	int k=0;
	for(int i=1;i<=n;++i)rank[SA[i]]=i;
	for(int i=1;i<=n;++i){
		if(rank[i]==1){
			continue;
		}
		if(k)k--;
		int id=SA[rank[i]-1];
		
		while(id+k<=n&&i+k<=n&&S[i+k]==S[id+k])++k;
		height[rank[i]]=k;
	}
	for(int i=2;i<=n;++i)cout<<height[i]<<" ";
}
int main(){
//	freopen("test.in","r",stdin);
	scanf("%s",S+1);
	n=strlen(S+1);
	m=200;
	Get_SA();
	Get_Height();
}

评测结果