字尾陣列(模版測試中)
阿新 • • 發佈:2018-12-29
倍增法
#include<iostream> #include<cstring> const int N = 1e5 + 5; char s[N]; int sa[N], ra[N], wa[N], wb[N], wv[N], ws[N], height[N], next[N], n; bool cmp(const int *f, const int &a, const int &b, const int &j) { return f[a] == f[b] && f[a + j] == f[b + j]; } void getSA() { int *x = wa, *y = wb, m = 128; memset(ws, 0, sizeof(ws)); for (int i = 0; i < n; ++i)++ws[x[i] = s[i]]; for (int i = 1; i < m; ++i)ws[i] += ws[i - 1]; for (int i = n - 1; i >= 0; --i)sa[--ws[x[i]]] = i; for (int j = 1, p = 1; p < n; j <<= 1, m = p) { p = 0; for (int i = n - j; i < n; ++i)y[p++] = i; for (int i = 0; i < n; ++i)if (sa[i] >= j)y[p++] = sa[i] - j; memset(ws, 0, sizeof(ws)); for (int i = 0; i < n; ++i)wv[i] = x[y[i]]; for (int i = 0; i < n; ++i)++ws[wv[i]]; for (int i = 1; i < m; ++i)ws[i] += ws[i - 1]; for (int i = n - 1; i >= 0; --i)sa[--ws[wv[i]]] = y[i]; std::swap(x, y); p = 1; x[sa[0]] = 0; for (int i = 1; i < n; ++i) x[sa[i]] = cmp(y, sa[i], sa[i - 1], j) ? p - 1 : p++; } } void getHeight() { for (int i = 0; i < n; ++i)ra[sa[i]] = i; int k = 0; memset(height, 0, sizeof(height)); for (int i = 0; i < n; height[ra[i++]] = k) { if (k)--k; for (int j = sa[ra[i] - 1]; i + k < n&&j + k < n&&s[i + k] == s[j + k]; ++k); } }