poj 3461（kmp字符串匹配模板）

kmp：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue>
#include<set>
#include<cstring>
#include<algorithm>
#define LL long long
#define MOD 100000007
#define INF 0x3f3f3f3f
#define lson s,mid,n<<1
#define rson mid+1,e,n<<1||1
using namespace std;

const int maxn=1000007;
const int maxm=10005;
char s1[maxm],s2[maxn];
int nex[maxm];

void getnext(char *s1,int len1)
{
    int i=0,j=-1;
    nex[0]=-1;
    while(i<len1)
    {
        if(j==-1||s1[j]==s1[i])nex[++i]=++j;
        else j=nex[j];
    }
}
int kmp(char *s1,char *s2)
{
    int i=0,j=0,cnt=0;
    int len1=strlen(s1);
    int len2=strlen(s2);
    getnext(s1,len1);
    while(i<len2&&j<len1)
    {
        if(j==-1||s2[i]==s1[j])i++,j++;
        else j=nex[j];
        if(j==len1)cnt++,j=nex[j];
    }
    return cnt;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s%s",s1,s2);
        printf("%d\n",kmp(s1,s2));
    }
    return 0;
}