POJ-3461(KMP模版题)

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
using namespace std;
const int N=1e6+10;
char T
;
char P
;
int next
;
int sum;
void Getnext()
{
int j=-1;
int i=0;
int len=strlen(P);
next[0]=-1;
while(i<len)
{
if(j==-1||P[i]==P[j])
{
i++;
j++;
next[i]=j;
}
else
j=next[j];
}
}
void kmp()
{
int n,m;
int i,q;
n = strlen(T);
m = strlen(P);
for (i = 0,q = 0; i < n; ++i)
{
while(q > 0 && P[q] != T[i])
q = next[q];
if (P[q] == T[i])
{
q++;
}
if (q == m)
{
sum++;
}
}
}

int main()
{
int K;
scanf("%d",&K);
while(K--)
{
sum=0;
for(int i=0;i<=N;i++)
{
next[i]=0;
}
scanf("%s%s",P,T);
Getnext();
kmp();
cout<<sum<<endl;
}
}