#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fod(i,a,b) for(i=a;i>=b;i--)
using namespace std;
int n,m;
int SA[100001],rank[100001],ct[100001],s2[100001],r1[100001],height[100001];
char st[100001];
void findh()
{
height[1]=0;
int i=0,j;
fo(i,1,n)
{
if (rank[i]==1) continue;
j=max(height[rank[i-1]]-1,0);
while (st[i+j]==st[SA[rank[i]-1]+j]) j++;
height[rank[i]]=j;
}
}
void make()
{
memset(ct,0,sizeof(ct));
int i,j,k,mx;
fo(i,1,n) ct[rank[i]=st[i]]++;
fo(i,1,m) ct[i]+=ct[i-1];
fod(i,n,1) SA[ct[rank[i]]--]=i;
mx=m;
for(j=1,k=0;k<n;j*=2,mx=k)
{
int p=0;
fo(i,n-j+1,n) s2[++p]=i;
fo(i,1,n) if(SA[i]>j) s2[++p]=SA[i]-j;
memset(ct,0,sizeof(ct));
fo(i,1,n) ct[rank[s2[i]]]++;
fo(i,1,mx) ct[i]+=ct[i-1];
fod(i,n,1) SA[ct[rank[s2[i]]]--]=s2[i];
r1[SA[1]]=k=1;
fo(i,2,n) r1[SA[i]]=(rank[SA[i-1]]==rank[SA[i]]&&rank[SA[i-1]+j]==rank[SA[i]+j])?k:++k;
fo(i,1,n) rank[i]=r1[i];
}
}
int main()
{
freopen("SA.in","r",stdin);
scanf("%s",st+1);
n=strlen(st+1);
int i;
fo(i,1,n)
{
int cm=st[i];
m=max(m,cm);
}
make();
fo(i,1,n) printf("%d ",SA[i]);
cout<<endl;
findh();
fo(i,2,n) printf("%d ",height[i]);
}
后缀数组(SA)模版
最新推荐文章于 2024-07-24 11:25:06 发布