2020牛客多校训练第一场_A( B-Suffix Array) 后缀数组

题意： 给你一个整数N 和一个长度为N的字符串S，问经过B-function（后面说明）后，S的所有后缀的排序（按照字典序排序）位次如何。

B-function的意思；就是对于当前的字串（后缀）进行操作操作如下：
翻译一下就是：对于子串中的每一个字符有一个权值，权值定义为在（1，i）i为当先子串开始下标 离i最近的相同字符的距离，若没有则为0

样例解释：
5
abaab
分解的得到五个后缀：

后缀	B-function	id
abaab	00213	1
baab	0013	2
aab	010	3
ab	00	4
b	0	5

按字典序排序过后

后缀	B-function	id
b	0	5
ab	00	4
baab	0013	2
abaab	00213	1
aab	010	3

上面的答案就应该是：5 4 2 1 3

解法： 直接套板子就过了；

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
char sstr[maxn];
int s[maxn];
int x[maxn], y[maxn], sa[maxn], c[maxn], height[maxn], rak[maxn];//rak[i],后缀i在排完序的数组里的排名，sa[i]排名为i的后缀在原串里的位置
int rk[maxn], trk[maxn], tsa[maxn];
int n, m;
inline void getsa()
{
    int *xx=x,*yy=y;
    memset(c, 0, sizeof(int)*(m));
    for (int i = 1; i <= n; ++i)++c[xx[i] = s[i]];
    for (int i = 2; i <= m; ++i)c[i] += c[i - 1];
    for (int i = n; i >= 1; --i)sa[c[xx[i]]--] = i;
    for (int k = 1; k <= n; k <<= 1)
    {
        int num = 0;
        for (int i = n - k + 1; i <= n; ++i)yy[++num] = i;
        for (int i = 1; i <= n; ++i)if (sa[i] > k)yy[++num] = sa[i] - k;
        for (int i = 1; i <= m; ++i)c[i] = 0;
        for (int i = 1; i <= n; ++i)++c[xx[i]];
        for (int i = 2; i <= m; ++i)c[i] += c[i - 1];
        for (int i = n; i >= 1; --i)sa[c[xx[yy[i]]]--] = yy[i], yy[i] = 0;//sort
        swap(xx, yy);
        xx[sa[1]] = 1; num = 1;
        for (int i = 2; i <= n; ++i)
            xx[sa[i]] = (yy[sa[i]] == yy[sa[i - 1]] && yy[sa[i] + k] == yy[sa[i - 1] + k]) ? num : ++num;
        if (num == n)break;
        m = num;
    }
}
void build_sa()
{
    for (int i = 1; i <= n; i++)c[i] = 0;
    for (int i = 1; i <= n; i++)c[s[i]]++;
    for (int i = 1; i <= n; i++)c[i] += c[i - 1];
    for (int i = n; i; i--)sa[c[s[i]]--] = i;
    rk[sa[1]] = 1; int p = 1;
    for (int i = 2; i <= n; i++)
    {
        if (s[sa[i]] != s[sa[i - 1]]) p++;
        rk[sa[i]] = p;
    }
    m = p;
    for (int j = 1; m < n; j *= 2)
    {
        p = 0;
        for (int i = 1; i <= m; i++)
            c[i] = 0;     
        for (int i = 1; i <= n; i++)
            trk[i] = rk[i];
        for (int i = n + 1; i <= n + j; i++)
            trk[i] = 0;
        for (int i = n - j + 1; i <= n; i++)tsa[++p] = i;
        for (int i = 1; i <= n; i++)if (sa[i] > j)tsa[++p] = sa[i] - j;
        for (int i = 1; i <= n; i++)c[trk[tsa[i]]]++;
        for (int i = 1; i <= m; i++)c[i] += c[i - 1];
        for (int i = n; i; i--)sa[c[trk[tsa[i]]]--] = tsa[i];
        p = 1;
        rk[sa[1]] = 1;
        for (int i = 2; i <= n; i++)
        {
            if (trk[sa[i]] != trk[sa[i - 1]]|| trk[sa[i] + j] != trk[sa[i - 1] + j]) p++;
            rk[sa[i]] = p;
        }
        m = p;
    }
}
int main()
{
    while (scanf("%d", &n) != EOF)
    {
        scanf("%s", sstr + 1);
        // reverse(sstr + 1, sstr + 1 + n);
        int pre[2] = {-1, -1};
        for (int i = n; i >= 1; --i)
        {
            if (pre[sstr[i] - 'a'] != -1)
            {
                s[i] = n + 1 - (pre[sstr[i] - 'a'] - i);
            }else{
                s[i] = 1;
            }
            pre[sstr[i] - 'a'] = i;
        }
        m = n + 10;
        //getsa();
        build_sa();
        for (int i = 1; i <= n;++i)
        {
            printf("%d ", sa[i]);
        }
        puts("");
    }
}