优化计数排序值域的后缀数组

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e6 + 7;
int n, m, p;
int sa[maxn], cnt[maxn];
int rk[maxn<<1], oldrk[maxn<<1],id[maxn], px[maxn];
char s[maxn];
bool cmp(int x, int y, int w)
{
	return oldrk[x] == oldrk[y] && oldrk[x + w] == oldrk[y + w];
}
void getsa()
{
	m = 300;
	for (int i = 1; i <= n; i++)++cnt[rk[i] = s[i]];
	for (int i = 1; i <= m; ++i)cnt[i] += cnt[i - 1];
	for (int i = n; i >= 1; --i)sa[cnt[rk[i]]--] = i;
	for (int w = 1; w < n; w <<= 1,m=p)
	{
		p = 0;
		for (int i = n; i > n - w; --i)id[++p] = i;
		for (int i = 1; i <= n; ++i)
			if (sa[i] > w)id[++p] = sa[i] - w;
		memset(cnt, 0, sizeof(cnt));
		for (int i = 1; i <= n; ++i)++cnt[px[i] = rk[id[i]]];
		for (int i = 1; i <= m; ++i)cnt[i] += cnt[i - 1];
		for (int i = n; i >= 1; --i)sa[cnt[px[i]]--] = id[i];
		memcpy(oldrk,rk,sizeof(rk));
		p = 0;
		for (int i = 1; i <= n; ++i)
		{
			rk[sa[i]] = cmp(sa[i], sa[i - 1], w) ? p : ++p;
		}
	}
}
int main()
{
	scanf("%s", s + 1);
	n = strlen(s + 1);
	getsa();
	for (int i = 1; i <= n; ++i)cout << sa[i] << " ";
	cout << endl;
}