kmp练习poj3461

题意
求模式串在文本串中出现的次数

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const int maxn = 1000050;
const int maxm = 10050;
char s[maxn],p[maxm];
int fail[maxm];

void getFail()
{
    int len = strlen(p);
    fail[0] = fail[1] = 0;
    for(int i = 1; i < len; i++)
    {
        int j = fail[i];
        while(j && p[j] != p[i]) j = fail[j];
        if(p[j] == p[i]) fail[i+1] = fail[i] + 1;
        else fail[i+1] = 0;
    }
}
int solve()
{
    getFail();
    int ans = 0,n = strlen(s),m = strlen(p),j=0;
    for(int i = 0; i < n ; i++)
    {
        if(s[i] == p[j]) j++;
        else
        {
            while(j && s[i] != p[j]) j = fail[j];
            if(s[i] == p[j]) j++;
        }
        if(j == m)
        {
            ans++; j = fail[j];
        }
    }
    return ans;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s%s",p,s);
        printf("%d\n",solve());
    }
    return 0;
}