题意:经典模式匹配问题。
思路:KMP(Knuth-Morris-Pratt)算法。采用的算法导论里的伪代码模板。
#include <cstdio>
#include <cstring>
char s[10005],t[1000005];
int T,next[10005],lens,lent;
void getnext(){
int i,k;
next[0] = k = -1;
for(i = 1;i<lens;i++){
while(k>-1 && s[k+1] != s[i])
k = next[k];
if(s[k+1] == s[i])
k++;
next[i] = k;
}
}
int main(){
scanf("%d",&T);
while(T--){
int i,j,res=0;
scanf("%s %s",s,t);
lens = (int)strlen(s);
lent = (int)strlen(t);
getnext();
for(i = 0,j = -1;i<lent;i++){
while(j>-1 && s[j+1]!=t[i])
j = next[j];
if(s[j+1] == t[i])
j++;
if(j == lens-1){
res++;
j = next[j];
}
}
printf("%d\n",res);
}
return 0;
}