yaoxi-std 的博客

$\text{开}\mathop{\text{卷}}\limits^{ju\check{a}n}\text{有益}$

0%

P3809 【模版】后缀排序 题解

发表于 更新于 分类于

P3809 【模版】后缀排序 题解

题面

题目链接

解法

模版题不多说

记住代码中每个数组的含义：

数组 含义
$sa_i$ 排名为$i$的后缀的起始位置
$rk_i$ 后缀$s_{i \cdots n}$的排名
$tp_i$ 临时数组，用来在基数排序中记录临时排名
$ht_i$ 第$rki$个后缀和第$rk{i-1}$个后缀的$LCP$ 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
struct suffix_array {
    int n, sa[MAXN], rk[MAXN], tp[MAXN], ht[MAXN];
    void radix_sort(int m) {
        static int buk[MAXN];
        for (int i = 0; i <= m; ++i)
            buk[i] = 0;
        for (int i = 1; i <= n; ++i)
            buk[rk[i]]++;
        for (int i = 1; i <= m; ++i)
            buk[i] += buk[i - 1];
        for (int i = n; i >= 1; --i)
            sa[buk[rk[tp[i]]]--] = tp[i];
    }
    void init(char *s, int n) {
        this->n = n;
        int m = 100;
        for (int i = 1; i <= n; ++i)
            rk[i] = s[i] - '0' + 1, tp[i] = i;
        radix_sort(m);
        for (int p = 0, w = 1; p < n; m = p, w <<= 1) {
            p = 0;
            for (int i = 1; i <= w; ++i)
                tp[++p] = n - w + i;
            for (int i = 1; i <= n; ++i)
                if (sa[i] > w)
                    tp[++p] = sa[i] - w;
            radix_sort(m);
            copy(rk + 1, rk + n + 1, tp + 1);
            rk[sa[1]] = p = 1;
            for (int i = 2; i <= n; ++i) {
                if (tp[sa[i - 1]] == tp[sa[i]] && tp[sa[i - 1] + w] == tp[sa[i] + w])
                    rk[sa[i]] = p;
                else
                    rk[sa[i]] = ++p;
            }
        }
        for (int i = 1, k = 0; i <= n; ++i) {
            if (k)
                k--;
            while (s[i + k] == s[sa[rk[i] - 1] + k])
                k++;
            ht[i] = k;
        }
    }
};

AC代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
/**
 * @file:           P3809.cpp
 * @author:         yaoxi-std
 * @url:            https://www.luogu.com.cn/problem/P3809
*/
// #pragma GCC optimize ("O2")
// #pragma GCC optimize ("Ofast", "inline", "-ffast-math")
// #pragma GCC target ("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define resetIO(x) \
    freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout)
#define debug(fmt, ...) \
    fprintf(stderr, "[%s:%d] " fmt "\n", __FILE__, __LINE__, ##__VA_ARGS__)
template <class _Tp>
inline _Tp& read(_Tp &x) {
    bool sign = false;
    char ch = getchar();
    long double tmp = 1;
    for (; !isdigit(ch); ch = getchar())
        sign |= (ch == '-');
    for (x = 0; isdigit(ch); ch = getchar())
        x = x * 10 + (ch ^ 48);
    if (ch == '.')
        for (ch = getchar(); isdigit(ch); ch = getchar())
            tmp /= 10.0, x += tmp * (ch ^ 48);
    return sign ? (x = -x) : x;
}
template <class _Tp>
inline void write(_Tp x) {
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar((x % 10) ^ 48);
}
const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f3f3f3f3f;
struct suffix_array {
    int n, sa[MAXN], rk[MAXN], tp[MAXN], ht[MAXN];
    void radix_sort(int m) {
        static int buk[MAXN];
        for (int i = 0; i <= m; ++i)
            buk[i] = 0;
        for (int i = 1; i <= n; ++i)
            buk[rk[i]]++;
        for (int i = 1; i <= m; ++i)
            buk[i] += buk[i - 1];
        for (int i = n; i >= 1; --i)
            sa[buk[rk[tp[i]]]--] = tp[i];
    }
    void init(char *s, int n) {
        this->n = n;
        int m = 100;
        for (int i = 1; i <= n; ++i)
            rk[i] = s[i] - '0' + 1, tp[i] = i;
        radix_sort(m);
        for (int p = 0, w = 1; p < n; m = p, w <<= 1) {
            p = 0;
            for (int i = 1; i <= w; ++i)
                tp[++p] = n - w + i;
            for (int i = 1; i <= n; ++i)
                if (sa[i] > w)
                    tp[++p] = sa[i] - w;
            radix_sort(m);
            copy(rk + 1, rk + n + 1, tp + 1);
            rk[sa[1]] = p = 1;
            for (int i = 2; i <= n; ++i) {
                if (tp[sa[i - 1]] == tp[sa[i]] && tp[sa[i - 1] + w] == tp[sa[i] + w])
                    rk[sa[i]] = p;
                else
                    rk[sa[i]] = ++p;
            }
        }
        for (int i = 1, k = 0; i <= n; ++i) {
            if (k)
                k--;
            while (s[i + k] == s[sa[rk[i] - 1] + k])
                k++;
            ht[i] = k;
        }
    }
};
int n;
char s[MAXN];
suffix_array sa;
signed main() {
    scanf("%s", s + 1);
    n = strlen(s + 1);
    sa.init(s, n);
    for (int i = 1; i <= n; ++i)
        write(sa.sa[i]), putchar(" \n"[i == n]);
    return 0;
}