-
Notifications
You must be signed in to change notification settings - Fork 0
/
suffix-array.cpp
71 lines (62 loc) · 1.66 KB
/
suffix-array.cpp
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
#pragma once
#include <bits/stdc++.h>
using namespace std;
// Manber and Myers O(n log^2 n)
class SuffixArray {
private:
const string s;
int n;
vector<int> sa;
bool low_comp(const string& t, int si = 0, int ti = 0) {
int tn = t.size();
while(si < n && ti < tn) {
if(s[si] != t[ti]) return s[si] < t[ti];
si++;
ti++;
}
return si >= n && ti < tn;
}
public:
explicit SuffixArray(const string& str) : s(str), n(str.size()), sa(n) {
vector<int> rank(n), tmp(n);
for(int i = 0; i < n; i++) {
sa[i] = i;
rank[i] = str[i];
}
int k;
auto comp = [&](int i, int j) -> bool {
if(rank[i] != rank[j])
return rank[i] < rank[j];
else {
int ri = i + k < n ? rank[i + k] : -1;
int rj = j + k < n ? rank[j + k] : -1;
return ri < rj;
}
};
for(k = 1; k <= n; k *= 2) {
sort(sa.begin(), sa.end(), comp);
tmp[sa[0]] = 0;
for(int i = 1; i < n; i++)
tmp[sa[i]] = tmp[sa[i - 1]] + comp(sa[i - 1], sa[i]);
rank.swap(tmp);
}
}
int operator[](int i) const {
assert(0 <= i && i <= n);
return sa[i];
}
int lower_bound(const string& t) {
int l = -1, r = n;
while(r - l > 1) {
int mid = (l + r) / 2;
(low_comp(t, sa[mid]) ? l : r) = mid;
}
return r;
}
int upper_bound(string& t) {
t.back()++;
int res = lower_bound(t);
t.back()--;
return res;
}
};