diff options
author | Ta180m | 2019-07-26 21:15:39 -0500 |
---|---|---|
committer | GitHub | 2019-07-26 21:15:39 -0500 |
commit | a010defc6cd808ae5abac0ab11848d38142a60ea (patch) | |
tree | 9068d7532089f819f30728257fe3cc4ece139bad /String | |
parent | 367224a689b50fe0b1dc9cb696a93958086c1b21 (diff) |
Create suffix_array.cpp
Diffstat (limited to 'String')
-rw-r--r-- | String/suffix_array.cpp | 30 |
1 files changed, 30 insertions, 0 deletions
diff --git a/String/suffix_array.cpp b/String/suffix_array.cpp new file mode 100644 index 0000000..a85bc1b --- /dev/null +++ b/String/suffix_array.cpp @@ -0,0 +1,30 @@ +#include <algorithm> +#include <vector> +#include <string> +using namespace std; + +vector<int> suffix_array(string &S) { + int N = S.length(); + vector<int> SA(N), rank(N); + for (int i = 0; i < N; i++) { + SA[i] = N - i - 1; + rank[i] = S[i]; + } + stable_sort(SA.begin(), SA.end(), [&S](int i, int j) { return S[i] < S[j]; }); + for (int t = 1; t < N; t <<= 1) { + vector<int> tmp(rank); + for (int i = 0; i < N; i++) { + bool s = i && SA[i - 1] + t < N && tmp[SA[i]] == tmp[SA[i - 1]] && tmp[SA[i] + t >> 1] == tmp[SA[i - 1] + t >> 1]; + rank[SA[i]] = s ? rank[SA[i - 1]] : i; + } + + tmp = SA; + vector<int> cnt(N); + for (int i = 0; i < N; i++) cnt[i] = i; + for (int i = 0; i < N; i++) { + int s = tmp[i] - t; + if (s >= 0) SA[cnt[rank[s]]++] = s; + } + } + return SA; +} |