[BZOJ1031][[JSOI2007]字符加密Cipher] 后缀数组

昨天maple来讲了一下后缀数组，解决了我多年以来的困惑

今天尝试着把后缀数组写出来

后缀数组细节很多啊，调起来不容易，尽量肉眼debug和输出调试

很多相似却不相同的代码块，注意比较它们之间的差异，这样可能会好调试一点

#include <iostream>
#include <cstdio>
#include <cstring>

#define N 200050

#define FOR for (int i=1;i<=n;i++)
#define REP for (int i=n;i>=1;i--)

using namespace std;

char s[N];
int sa[N],n;
int sum[N],rank[N],nrank[N],nsa[N];

void _sort(int j) {
	memset(sum,0,sizeof(sum));
	for (int i=1;i<=n;i++) sum[ rank[i+j] ]++;
	for (int i=1;i<=n;i++) sum[i] += sum[i-1];
	for (int i=n;i>=1;i--) nsa[ sum[rank[i+j]]-- ] = i;
	
	memset(sum,0,sizeof(sum));
	for (int i=1;i<=n;i++) sum[ rank[i] ]++;
	for (int i=1;i<=n;i++) sum[i] += sum[i-1];
	for (int i=n;i>=1;i--) sa[ sum[rank[ nsa[i] ]]-- ] = nsa[i];
}

void _sa() {
	memset(sum,0,sizeof(sum));
	
	for (int i=1;i<=n;i++) rank[i] = s[i];
	for (int i=1;i<=n;i++) sum[ rank[i] ]++;
	for (int i=1;i<=255;i++) sum[i] += sum[i-1];
	for (int i=n;i>=1;i--) 
		sa[ sum[rank[i]]-- ] = i;
	
	nrank[ sa[1] ] = 1;
	for (int i=2,p=1;i<=n;i++) 
 		nrank[ sa[i] ] = rank[ sa[i] ] == rank[ sa[i-1] ] ? p : ++p;
	for (int i=1;i<=n;i++) rank[i] = nrank[i];
	
	for (int j=1;j<=n;j<<=1) {
		_sort(j);
		nrank[ sa[1] ] = 1;
		for (int i=2,p=1;i<=n;i++) {
			if (rank[ sa[i] ] != rank[ sa[i-1] ] || rank[ sa[i]+j ] != rank[ sa[i-1]+j ]) p++;
			nrank[ sa[i] ] = p;
		}
		for (int i=1;i<=n;i++) rank[i] = nrank[i];
	}
	
	return ;
}

int main() {
//	freopen("1.in","r",stdin);
	scanf("%s",s+1); n = strlen(s+1);
	for (int _=1;_<=n;_++) s[_+n] = s[_];
	n *= 2;
	_sa();
	for (int i=1;i<=n;i++) if (sa[i] <= n/2)
		printf("%c",s[ sa[i]+n/2-1 ]);
	printf("\n");
	return 0;
}