-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathSuffixArray.cpp
More file actions
65 lines (49 loc) · 1.23 KB
/
SuffixArray.cpp
File metadata and controls
65 lines (49 loc) · 1.23 KB
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
#include <bits/stdc++.h>
#define MX 1e4+5
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef pair<char, int> pci;
typedef vector<pci> vci;
int main() {
string s;
cin >> s;
s += "$";
int n = s.size();
vi sufInd(n), sufClass(n);
{
vci sufArr(n);
for(int i = 0; i < n; i++)
sufArr[i] = {s[i], i};
sort(sufArr.begin(), sufArr.end());
for(int i = 0; i < n; i++)
sufInd[i] = sufArr[i].second;
sufClass[sufInd[0]] = 0;
for(int i = 1; i < n; i++)
if (sufArr[i].first == sufArr[i-1].first)
sufClass[sufInd[i]] = sufClass[sufInd[i-1]];
else
sufClass[sufInd[i]] = sufClass[sufInd[i-1]] + 1;
}
int k = 0;
while((1 << k) < n) {
vector<pair<pii, int>> sufArr(n);
for(int i = 0; i < n; i++)
sufArr[i] = {{sufClass[i], sufClass[(i + (1 << k)) % n]}, i};
sort(sufArr.begin(), sufArr.end());
for(int i = 0; i < n; i++)
sufInd[i] = sufArr[i].second;
sufClass[sufInd[0]] = 0;
for(int i = 1; i < n; i++)
if (sufArr[i].first == sufArr[i-1].first)
sufClass[sufInd[i]] = sufClass[sufInd[i-1]];
else
sufClass[sufInd[i]] = sufClass[sufInd[i-1]] + 1;
k++;
}
for(int x: sufInd)
cout << x << " ";
cout << "\n";
return 0;
}