BZOJ1031: [JSOI2007]字符加密Cipher Burrows-Wheeler变换 后缀数组

https://www.lydsy.com/JudgeOnline/problem.php?id=1031

题目里说的这加密算法是后缀数组的经典应用之一。。

断环成链即可， 注意复制原数组时int和char分开赋值，否则会出玄学错误。

人傻bug多裸题还交了好几发才ac..

z要赋值n << 1 | 1不然会RE我也不知道为啥 如果哪位大爷知道了还请教教我

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1000007;
#define Max(_A,_B) (_A>_B?_A:_B)
int z, n;
char s[maxn];
int sa[maxn], t[maxn], t2[maxn], cnt[maxn];
bool cmp(int *rua, int a, int b, int j) {
    return rua[a] == rua[b] && rua[a + j] == rua[b + j];
}
void doubling(int n, int m) {  //m为最大的字符值
    int *x = t, *y = t2, i;
    for (i = 0; i < n; i++) cnt[x[i]]++;
    for (i = 1; i < m; i++) cnt[i] += cnt[i - 1];
    for (i = n - 1; i >= 0; i--) sa[--cnt[x[i]]] = i; //对单个字符基排
    for (int j = 1, p; p < n; j <<= 1, 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;
        memset(cnt, 0, sizeof(cnt));         //双关键字基排
        for (i = 0; i < n; i++) cnt[x[y[i]]]++;
        for (i = 1; i < m; i++) cnt[i] += cnt[i - 1];
        for (i = n - 1; i >= 0; i--) sa[--cnt[x[y[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++;//离散化&排序
    }
}
int main(){
    scanf("%s", s);
    n = strlen(s);
    for (int i = 0; i < n; i++) t[i + n] = t[i] = s[i], s[i + n] = s[i];
    z = n << 1 | 1;
    doubling(z, 255);
    for (int i = 0; i < z; i++) if(sa[i] < n) putchar(s[sa[i] + n - 1]);
}