P3809 【模板】后缀排序

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define N 1000050
#define ri register int

using namespace std;
char s[N];
int n,m;
int sa[N],rank[N],tp[N],tax[N];

void cntsort(){
  for (ri i=0;i<=m;i++) tax[i]=0;
  for (ri i=1;i<=n;i++) tax[rank[i]]++;
  for (ri i=1;i<=m;i++) tax[i]+=tax[i-1];
  for (ri i=n;i>=1;i--) sa[tax[rank[tp[i]]]--]=tp[i]; /**/
}

void Suffixsort(){
  m=75;
  for (ri i=1;i<=n;i++) rank[i]=s[i]-‘0‘+1,tp[i]=i; /**/
  cntsort();
  for (ri w=1,p=0;p<n;m=p,w<<=1) {
    p=0;
    for (ri i=1;i<=w;i++) tp[++p]=n-w+i;
    for (ri i=1;i<=n;i++) if (sa[i]>w) tp[++p]=sa[i]-w;
    cntsort();
    swap(tp,rank); // tp rank not tp sa
    rank[sa[1]]=p=1; // low
    for (ri i=2;i<=n;i++) { // 2
      rank[sa[i]]=(tp[sa[i-1]]==tp[sa[i]] && tp[sa[i-1]+w]==tp[sa[i]+w]) ? p : ++p;
    }
  }
}

int main(){
  scanf("%s",s+1);
  n=strlen(s+1);
  Suffixsort();
  //cout<<n<<endl;
  for (ri i=1;i<=n;i++) printf("%d ",sa[i]);
}