后缀数组

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#include <cstdio>//sprintf islower isupper
#include <cstdlib>//malloc  exit strcat itoa system("cls")
#include <iostream>//pair
#include <fstream>//freopen("C:\Users\13606\Desktop\草稿.txt","r",stdin);
#include <bitset>
//#include <map>
//#include<unordered_map>
#include <vector>
#include <stack>
#include <set>
#include <string.h>//strstr substr
#include <string>
#include <time.h>//srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
#include <cmath>
#include <deque>
#include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
#include <vector>//emplace_back
//#include <math.h>
//#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
#include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
#define fo(a,b,c) for(register int a=b;a<=c;++a)
#define fr(a,b,c) for(register int a=b;a>=c;--a)
#define mem(a,b) memset(a,b,sizeof(a))
#define pr printf
#define sc scanf
#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
#define rint register int
void swapp(int &a,int &b);
double fabss(double a);
int maxx(int a,int b);
int minn(int a,int b);
int Del_bit_1(int n);
int lowbit(int n);
int abss(int a);
//const long long INF=(1LL<<60);
const double E=2.718281828;
const double PI=acos(-1.0);
const int inf=(1<<30);
const double ESP=1e-9;
const int mod=(int)1e9+7;
const int N=(int)2e6+10;

char s[N];
int a[N];
int sa[N],x[N],y[N],t[N];//桶的大小要为N,因为放的是rank;
void Init(int _[],int n)
{
    for(rint i=0;i<=n;++i)
        _[i]=0;
}
bool cmp(int i,int j,int k)
{
    return y[i]==y[j]&&y[i+k]==y[j+k];
}
void Sort(int len)
{
    int m=150;//字符集大小;
    for(rint i=1;i<=len;++i) ++t[a[i]],x[i]=a[i];
    for(rint i=1;i<=m;++i) t[i]+=t[i-1];
    for(rint i=len;i>=1;--i) sa[t[x[i]]--]=i;
    for(rint k=1;k<=len;k<<=1)
    {
        int cnt=0;
        //按第二个rank排;
        for(rint i=len-k+1;i<=len;++i) y[++cnt]=i;
        for(rint i=1;i<=len;++i)if(sa[i]>k) y[++cnt]=sa[i]-k;
        //按第一个rank排;
        Init(t,m);
        for(rint i=1;i<=len;++i) ++t[x[y[i]]];
        for(rint i=1;i<=m;++i) t[i]+=t[i-1];
        for(rint i=len;i>=1;--i) sa[t[x[y[i]]]--]=y[i];
        
        swap(x,y);x[sa[1]]=cnt=1;
        for(rint i=2;i<=len;++i)
            x[sa[i]]=cmp(sa[i],sa[i-1],k)?cnt:++cnt;
        if(cnt==len)break;
        m=cnt;
    }
}

int main()
{
//    freopen("D:\Chrome Download\testdata (2).in","r",stdin);
    sc("%s",s+1);
    int len=strlen(s+1);
    for(int i=1;i<=len;++i)
        a[i]=s[i];
    Sort(len);
    for(rint i=1;i<=len;++i)
        pr("%d%c",sa[i],i==len?'
':' ');
    return 0;
}

/**************************************************************************************/

int maxx(int a,int b)
{
    return a>b?a:b;
}

void swapp(int &a,int &b)
{
    a^=b^=a^=b;
}

int lowbit(int n)
{
    return n&(-n);
}

int Del_bit_1(int n)
{
    return n&(n-1);
}

int abss(int a)
{
    return a>0?a:-a;
}

double fabss(double a)
{
    return a>0?a:-a;
}

int minn(int a,int b)
{
    return a<b?a:b;
}