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
| char str[N];
int n, m, sa[N], rnk[N], ht[N], x[N], y[N], c[N];
void bucsort ()
{
for (int i = 1; i <= m; ++i) c[i] = 0;
for (int i = 1; i <= n; ++i) ++c[x[i]];
for (int i = 2; i <= m; ++i) c[i] += c[i - 1];
for (int i = n; i; i--) sa[c[x[y[i]]]--] = y[i];
}
void init ()
{
for (int i = 1; i <= n; ++i)
x[i] = str[i] - 'a' + 1, y[i] = i, sa[i] = 0;
bucsort();
for (int k = 1; k <= n; k <<= 1)
{
int cnt = 0;
for (int i = n - k + 1; i <= n; ++i) y[++cnt] = i;
for (int i = 1; i <= n; ++i)
if (sa[i] > k) y[++cnt] = sa[i] - k;
bucsort();
for (int i = 1; i <= n; ++i) y[i] = x[i];
x[sa[1]] = cnt = 1;
for (int i = 2; i <= n; ++i)
x[sa[i]] = cnt += (y[sa[i]] ^ y[sa[i - 1]] || y[sa[i] + k] ^ y[sa[i - 1] + k]);
if ((m = cnt) == n) break;
}
for (int i = 1; i <= n; ++i) rnk[sa[i]] = i;
for (int i = 1, k = 0; i <= n; ++i)
{
int j = sa[rnk[i] - 1];
if (k) --k;
while (str[i + k] == str[j + k]) ++k;
ht[rnk[i]] = k;
}
}
|