diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
| commit | 98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch) | |
| tree | 5113d5cc24d1ad5f93810b6442ce584a36950dc8 /string/manacher.cpp | |
| parent | ad3856a6b766087df0036de0b556f4700a6498c9 (diff) | |
| parent | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff) | |
mzuenni tests
Diffstat (limited to 'string/manacher.cpp')
| -rw-r--r-- | string/manacher.cpp | 20 |
1 files changed, 0 insertions, 20 deletions
diff --git a/string/manacher.cpp b/string/manacher.cpp deleted file mode 100644 index 112bd55..0000000 --- a/string/manacher.cpp +++ /dev/null @@ -1,20 +0,0 @@ -vector<int> manacher(const string& t) { - //transforms "aa" to ".a.a." to find even length palindromes - string s(sz(t) * 2 + 1, '.'); - for (int i = 0; i < sz(t); i++) s[2 * i + 1] = t[i]; - - int mid = 0, r = 0, n = sz(s); - vector<int> pal(n); - for (int i = 1; i < n - 1; i++) { - if (r > i) pal[i] = min(r - i, pal[2 * mid - i]); - while (pal[i] < min(i, n - i - 1) && - s[i + pal[i] + 1] == s[i - pal[i] - 1]) { - pal[i]++; - } - if (i + pal[i] > r) mid = i, r = i + pal[i]; - } - - //convert lengths to constructed string s (optional) - //for (int i = 0; i < n; i++) pal[i] = 2 * pal[i] + 1; - return pal; -} |
