diff options
| author | mzuenni <michi.zuendorf@gmail.com> | 2023-01-10 11:40:09 +0100 |
|---|---|---|
| committer | mzuenni <michi.zuendorf@gmail.com> | 2023-01-10 11:40:09 +0100 |
| commit | fd1f2b36e95c03625297b7b8cba3b1a04a0cc0ed (patch) | |
| tree | b143619750b90fbfa45a98be9ea56904d1a7129d /string/suffixArray.cpp | |
| parent | 8faa84ca282d51e9ce4fef535e68325adabcebad (diff) | |
change whitespaces
Diffstat (limited to 'string/suffixArray.cpp')
| -rw-r--r-- | string/suffixArray.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/string/suffixArray.cpp b/string/suffixArray.cpp index 2650d72..3494a0b 100644 --- a/string/suffixArray.cpp +++ b/string/suffixArray.cpp @@ -6,12 +6,12 @@ struct SuffixArray { SuffixArray(const string& s) : n(sz(s)) { SA.resize(n); LCP.resize(n); L.resize(n); - P.assign(ceil(log2(n)) + 1, vector<int>(n)); + P.assign(__ln(n)*4-2, vector<int>(n)); for (int i = 0; i < n; i++) P[0][i] = s[i]; for (step = 1, count = 1; count < n; step++, count *= 2) { for (int i = 0; i < n; i++) L[i] = {{P[step-1][i], - i+count < n ? P[step-1][i+count] : -1}, i}; + i+count < n ? P[step-1][i+count] : -1}, i}; sort(all(L)); for (int i = 0; i < n; i++) { P[step][L[i].second] = |