CF471D MUH and Cube Walls(差分+KMP)

先差分，然后kmp匹配。注意m==1的情况。

#include <cstdio>
#include <cstring>
#define N 200010
int s[N],t[N],n,m,fail[N],ans=0;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void getfail(){
	int k=0;fail[1]=0;
	for(int i=2;i<=m;++i){
		while(k&&t[k+1]!=t[i]) k=fail[k];
		if(t[k+1]==t[i]) ++k;
		fail[i]=k;
	}
}
int main(){
//	freopen("a.in","r",stdin);
	n=read();m=read();
	for(int i=1;i<=n;++i) s[i]=read();
	for(int i=1;i<=m;++i) t[i]=read();
	if(m==1){
		printf("%d\n",n);return 0;
	}
	for(int i=2;i<=n;++i) s[i-1]=s[i]-s[i-1];--n;
	for(int i=2;i<=m;++i) t[i-1]=t[i]-t[i-1];--m;
	getfail();
	int k=0;
	for(int i=1;i<=n;++i){
		while(k&&t[k+1]!=s[i]) k=fail[k];
		if(t[k+1]==s[i]) ++k;
		if(k==m) ans++;
	}
	printf("%d",ans);
	return 0;
}