P3809 【模板】后缀排序

后缀数组

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;
#define MAXNUM 11111111
int wa[MAXNUM], wb[MAXNUM], gap, wss[MAXNUM], wv[MAXNUM];
int a[MAXNUM],sa[MAXNUM];
int cmp(int *r, int a, int b, int l) {
	return r[a] == r[b] && r[a + l] == r[b + l];
}
//传入size+1,并在最后加上0，最后的后缀数组结果包括0
void da(int *r,int *sa, int n, int m) 
{          //  倍增算法 r为待匹配数组  n为总长度 m为字符范围  
	int i, j, p, *x = wa, *y = wb, *t;

	for (i = 0; i < m; i++) wss[i] = 0;
	for (i = 0; i < n; i++) wss[x[i] = r[i]] ++;
	for (i = 1; i < m; i++) wss[i] += wss[i - 1];
	for (i = n - 1; i >= 0; i--) sa[--wss[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++) wss[i] = 0;
		for (i = 0; i < n; i++) wss[wv[i]] ++;
		for (i = 1; i < m; i++) wss[i] += wss[i - 1];
		for (i = n - 1; i >= 0; i--) sa[--wss[wv[i]]] = y[i];

		for (t = x, x = y, y = t, 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++;
	}
}
//res数组下标为排序后的序号
//res[i]为suffix[i]与suffix[i-1]的lcp
//传入size+1
int LCP(int s[], int size, int sorted[], int res[])
{
	int n = size;
	int k = 0;
	int max = 0;
	for (int i = 0; i < size; i++)
		wa[sorted[i]] = i;
	for (int i = 0; i < n; i++)
	{
		int j = sorted[wa[i] - 1];
		while (i + k < n&&j + k < n&&s[i + k] == s[j + k])
			k++;
		res[wa[i]] = k;
		if (k > max)
			max = k;
		if (k)
			k--;
	}
	return max;
}

char str[1111111];
int main()
{
    scanf("%s",str);
    int len=strlen(str);
    int cont=0;
    for(int i=0;i<len;i++) a[cont++]=str[i];
	a[cont]=0;
    da(a,sa,len+1,200);
    for(int i=1;i<=len;i++) printf("%d ",sa[i]+1);
    return 0;
}