poj3461kmp模板

http://poj.org/status

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;
const int MAXN=100007;
int nextval[MAXN];
const int N=1e7+10;

char s[N];
char p[10005];
void getnext(char p[]){
    int i=0,j=-1;
    nextval[0]=-1;
    int psize;
    psize=strlen(p);
    while(i<psize){
        if(j==-1||p[i]==p[j]){
            nextval[++i]=++j;
        }
        else
            j=nextval[j];
    }
}
int getkmp(char s[],char  p[]){
    int sum =0;
    int i=0,j=0;
    int ssize=strlen(s);
    int psize=strlen(p);
    getnext(p);
    while(i<ssize&&j<psize){
        if(j==-1||s[i]==p[j]){
            i++;
            j++;
        }
        else
            j=nextval[j];
        if(j==psize){
            j=nextval[j];
              sum++;
        }
    }
    return sum;

}

int main()
{
    int n;
    scanf("%d",&n);
    int sum;
        while(n--){
            scanf("%s%s",p,s);
            getnext(p);
            sum=getkmp(s,p);
            printf("%d\n",sum);

    }
    return 0;
}