Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- struct SuffixArray {
- string s;
- int n;
- vector<int> arr;
- SuffixArray(const string& str)
- : s(str + char(0))
- , n(size(s))
- , arr(n)
- {
- vector<int> c(n), buff(c);
- iota(all(arr), 0);
- for (int deg = 0; (1 << (deg - 1)) < n; deg++) {
- if (deg == 0) {
- sort(all(arr), [&] (int i, int j) { return s[i] < s[j]; });
- for (int i = 1; i < n; i++) {
- c[arr[i]] = c[arr[i - 1]] + (s[arr[i]] == s[arr[i - 1]] ? 0 : 1);
- }
- } else {
- int len = 1 << (deg - 1);
- sort(all(arr), [&] (int i, int j) {
- return c[i] < c[j] || (c[i] == c[j] && c[(i + len) % n] < c[(j + len) % n]);
- });
- for (int i = 1; i < n; i++) {
- buff[arr[i]] = buff[arr[i - 1]];
- if (c[arr[i]] != c[arr[i - 1]]) {
- buff[arr[i]]++;
- continue;
- }
- if (c[(arr[i] + len) % n] != c[(arr[i - 1] + len) % n]) {
- buff[arr[i]]++;
- continue;
- }
- }
- for (int i = 0; i < n; i++) {
- c[i] = buff[i];
- }
- }
- }
- }
- void Print() {
- for (int val : arr) {
- cout << val << ' ';
- }
- cout << '\n';
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement