HDU 5918 Sequence I

kmp 变形，主串里 i+=p; 并且一旦没有匹配到就return 0

【代码】/* ***********************************************
Author :angon

************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k) memset(a,k,sizeof(a))
#define LL long long
#define N 1000005
#define mod 1000000007
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}

int p;
int Next
,idx
;
int a
,b
;
void MakeNext(int m)
{
Next[0]=-1;
int i=0,j=-1;
while(i<m)
{
if(j==-1||b[i]==b[j])
{
++i,++j;
Next[i]=j;
}
else j=Next[j];
}
}
int KMP(int n,int m,int q) //a是主串，b是模式串，n是主串长，m是模式串长
{
//MakeNext(m);
int i=q,j=0;//,ret=0;
while(i<n)
{
if(a[i]==b[j]||j==-1) i+=p,++j;
else return 0;//j=Next[j];
if(j==m)
{
return 1;
// idx[ret++] = i-m; //各匹配到的模式串在主串中的首字母位置
// j=Next[j]; //允许在主串中重叠查找
/*j=0; //不允许重叠*/
}
}
return 0; //成功匹配次数
}

int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t; scan(t);
int cas =1;
while(t--)
{
int n,m;
scann(n,m); scan(p);
REP(i,0,n) scan(a[i]);
REP(i,0,m) scan(b[i]);
int ans = 0;
MakeNext(m);
//REP(i,0,m)
// printf("next[%d] = %d\n",i,Next[i]);
for(int i = 0; i+p*(m-1) < n; i++)
{
// printf("%d %d\n",i,KMP(n,m,i));
ans += KMP(n,m,i);
}
printf("Case #%d: %d\n",cas++,ans);
}

return 0;
}