代码

#include <bits/stdc++.h>
using namespace std;

const int N = 100010;
int Wa[N], Wb[N], Ws[N], sa[N], Wv[N];
int Rank[N], height[N];

bool cmp(int r[], int a, int b, int l) 
{
    return r[a] == r[b] && r[a+l] == r[b+l];
}

void da(int r[], int sa[], int n, int m) 
{
    int i, j, p, *x = Wa, *y = Wb;
    for (i = 0; i < m; ++i) Ws[i] = 0;
    for (i = 0; i < n; ++i) Ws[x[i]=r[i]]++;
    for (i = 1; i < m; ++i) Ws[i] += Ws[i-1];
    for (i = n-1; i >= 0; --i) sa[--Ws[x[i]]] = i;
    for (j = 1, p = 1; p < n; j *= 2, m = p) 
	{
        for (p = 0, i = n - j; i < n; ++i) y[p++] = i;
        for (i = 0; i < n; ++i) if (sa[i] >= j) y[p++] = sa[i] - j;
        for (i = 0; i < n; ++i) Wv[i] = x[y[i]];
        for (i = 0; i < m; ++i) Ws[i] = 0;
        for (i = 0; i < n; ++i) Ws[Wv[i]]++;
        for (i = 1; i < m; ++i) Ws[i] += Ws[i-1];
        for (i = n-1; i >= 0; --i) sa[--Ws[Wv[i]]] = y[i];
        for (swap(x, y), p = 1, x[sa[0]] = 0, i = 1; i < n; ++i)
            x[sa[i]] = cmp(y, sa[i-1], sa[i], j) ? p-1 : p++;
    }
}

void calheight(int r[], int sa[], int n) 
{
    int i, j, k = 0;
    for (i = 1; i <= n; ++i) Rank[sa[i]] = i;
    for (i = 0; i < n; height[Rank[i++]] = k)
        for (k?k--:0, j = sa[Rank[i]-1]; r[i+k] == r[j+k]; k++);
}

int a[N];
char s[N];
int n;
 
void display()
{
	for(int i=1;i<=n;i++) printf("%d ",sa[i]+1); putchar('\n'); 
	for(int i=2;i<=n;i++) printf("%d ",height[i]); 
}
int main()
{
	scanf("%s",s);
	n=strlen(s);
	for(int i=0;i<n;i++) a[i]=s[i];
	a[n]=0;
	da(a,sa,n+1,200);
	calheight(a,sa,n);
	display();
	return 0;
}

评测结果