subcrip
/
cp-templates
1
0
Fork 0
Code

Update include.hh

This commit is contained in:
Ariel 2024-01-17 21:09:19 +08:00 committed by GitHub
parent 58535bb387
commit 490360c54e
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 25 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
include.hh
View File

@ -97,8 +97,8 @@ template<typename T, typename... U> void __read(T& x, U&... args) { cin >> x; __
#define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();) #define popfront(q, ...) __AS_PROCEDURE(auto [__VA_ARGS__] = q.front();q.pop_front();)
/* algorithms */ /* algorithms */
vector<int> kmp(string s, string t) { // find all t in s vector<int> calc_next(string t) { // pi function of t
int n = s.length(), m = t.length(); int m = t.length();
vector<int> next; next.push_back(-1); vector<int> next; next.push_back(-1);
int j = -1, i = 0; int j = -1, i = 0;
while (i < m) while (i < m)
@ -107,8 +107,30 @@ vector<int> kmp(string s, string t) { // find all t in s
if (i != m && t[i] == t[j]) next.push_back(next[j]); if (i != m && t[i] == t[j]) next.push_back(next[j]);
else next.push_back(j); else next.push_back(j);
} else j = next[j]; } else j = next[j];
return next;
}
vector<int> calc_z(string t) { // z function of t
int m = t.length();
vector<int> z;
z.push_back(m);
pair<int, int> prev = {1, -1};
for (int i = 1; i < m; ++i) {
if (z[i - prev.first] + i <= prev.second) {
z.push_back(z[i - prev.first]);
} else {
int j = max(i, prev.second + 1);
while (j < m && t[j] == t[j - i]) ++j;
z.push_back(j - i);
prev = {i, j - 1};
}
}
return z;
}
vector<int> kmp(string s, string t) { // find all t in s
int n = s.length(), m = t.length();
vector<int> next= calc_next(t);
vector<int> res; vector<int> res;
i = 0, j = 0; int i = 0, j = 0;
while (i < n && j < m) while (i < n && j < m)
if (j == -1 || s[i] == t[j]) { if (j == -1 || s[i] == t[j]) {
++i, ++j; ++i, ++j;