题目链接:http://acm.zzuli.edu.cn/problem.php?id=2264
这道题只需要把两个数组的差值求出来,然后用kmp去求匹配数就好了。裸的kmp。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 1000005;
int Next[MAXN];
int a[MAXN],b[MAXN];
int n,len1,len2,sum,m;
int t[MAXN],p[MAXN];
void Com(){
Next[0] = 0;
int k = 0;
for(int q=1;q<m-1;q++){
while(k>0 && p[k]!=p[q])k = Next[k - 1];
if(p[k] == p[q])k++;
Next[q] = k;
}
return ;
}
void kmp(){
Com();
int q = 0;
for(int i=0;i<n-1;i++){
while(q>0 && p[q] != t[i])q = Next[q-1];
if(p[q] == t[i])q++;
if(q == m-1){
sum++;
q = Next[q-1];
}
}
return ;
}
int main()
{
scanf("%d%d",&n,&m);
int num = 0;
scanf("%d",&a[0]);
for(int i=1;i<n;i++){
scanf("%d",&a[i]);
t[num++] = (a[i] - a[i-1]);
}
scanf("%d",&b[0]);
num = 0;
for(int i=1;i<m;i++){
scanf("%d",&b[i]);
p[num++] = (b[i] - b[i-1]);
}
sum = 0;
kmp();
printf("%d\n",sum);
return 0;
}