poj3461 Oulipo(KMP)
2017-07-23 14:54
357 查看
求单词W在文本T中的出现次数。KMP裸题。
#include <cstdio>
#include <cstring>
#define N 1000005
#define M 10005;
char s
,t
;
int n,m,fail
;
inline void getfail(){
int k=0;fail[1]=0;
for(int i=2;i<=m;++i){
while(k&&t[k+1]!=t[i]) k=fail[k];
if(t[k+1]==t[i]) ++k;
fail[i]=k;
}
}
int main(){
// freopen("a.in","r",stdin);
int tst;scanf("%d",&tst);
while(tst--){
int ans=0;
scanf("%s%s",t+1,s+1);
n=strlen(s+1);m=strlen(t+1);
getfail();
int k=0;
for(int i=1;i<=n;++i){
while(k&&t[k+1]!=s[i]) k=fail[k];
if(t[k+1]==s[i]) ++k;
if(k==m) ++ans;
}
printf("%d\n",ans);
}
return 0;
}
#include <cstdio>
#include <cstring>
#define N 1000005
#define M 10005;
char s
,t
;
int n,m,fail
;
inline void getfail(){
int k=0;fail[1]=0;
for(int i=2;i<=m;++i){
while(k&&t[k+1]!=t[i]) k=fail[k];
if(t[k+1]==t[i]) ++k;
fail[i]=k;
}
}
int main(){
// freopen("a.in","r",stdin);
int tst;scanf("%d",&tst);
while(tst--){
int ans=0;
scanf("%s%s",t+1,s+1);
n=strlen(s+1);m=strlen(t+1);
getfail();
int k=0;
for(int i=1;i<=n;++i){
while(k&&t[k+1]!=s[i]) k=fail[k];
if(t[k+1]==s[i]) ++k;
if(k==m) ++ans;
}
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- poj3461 Oulipo【KMP】
- poj3461 Oulipo,Kmp
- 【KMP】POJ3461 Oulipo
- poj3461 Oulipo(KMP)
- poj3461 Oulipo —— KMP
- poj3461 Oulipo (KMP模板题~) 前面哪些也是模板题 O.O
- 【KMP】【POJ3461】Oulipo
- [poj3461]Oulipo_KMP
- POJ3461 Oulipo KMP裸题
- POJ3461[Oulipo]KMP裸题
- 【KMP】 poj3461 Oulipo
- POJ3461 Oulipo(字符串匹配KMP)
- [poj3461]Oulipo(kmp)
- Oulipo_poj3461_kmp
- POJ3461_Oulipo(KMP)
- poj3461 Oulipo (KMP模板题~) 前面哪些也是模板题 O.O
- POJ3461 Oulipo KMP模板
- POJ3461 Oulipo(kmp)
- 【KMP模板】POJ3461-Oulipo
- poj3461 Oulipo (kmp)