#include<cstdio>
#include<cstring>
#include<iostream>
#include<iomanip>
#include<queue>
#include<cmath>
#include<stack>
#include<map>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
char cs[110][110];
int f[110];
void fail (char p[]){
memset(f, 0, sizeof(f));
f[0] = f[1] = 0;
int len = strlen(p);
for(int i = 1; i < len; i++){
int u = f[i];
while(u && p[u]!=p[i]) u = f[u];
f[i+1] = (p[u]==p[i] ? u+1 : 0);
}
}
void myfind (char t[], char p[]){
int tt = strlen(t);
int pp = strlen(p);
int j = 0;
for(int i = 0; i < tt; i++){
while(j && t[i]!=p[j]) j = f[j];
if(t[i]==p[j]) j++;
result = (result < j ? j : result);
}
}
KMP模板
最新推荐文章于 2022-06-13 23:03:15 发布