Codeforces Round #269 (Div. 2) D. MUH and Cube Walls

题面

链接：Codeforces Round #269 (Div. 2) D. MUH and Cube Walls

Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing the cubes one on top of the other. They defined multiple towers standing in a line as a wall. A wall can consist of towers of different heights.

Horace was the first to finish making his wall. He called his wall an elephant. The wall consists of w towers. The bears also finished making their wall but they didn’t give it a name. Their wall consists of n towers. Horace looked at the bears’ tower and wondered: in how many parts of the wall can he “see an elephant”? He can “see an elephant” on a segment of w contiguous towers if the heights of the towers on the segment match as a sequence the heights of the towers in Horace’s wall. In order to see as many elephants as possible, Horace can raise and lower his wall. He even can lower the wall below the ground level (see the pictures to the samples for clarification).

Your task is to count the number of segments where Horace can “see an elephant”.

Input
The first line contains two integers n and w (1 ≤ n, w ≤ 2·105) — the number of towers in the bears’ and the elephant’s walls correspondingly. The second line contains n integers a i (1 ≤ a i ≤ 109) — the heights of the towers in the bears’ wall. The third line contains w integers b i (1 ≤ b i ≤ 109) — the heights of the towers in the elephant’s wall.

Output
Print the number of segments in the bears’ wall where Horace can “see an elephant”.

Examples
input
13 5
2 4 5 5 4 3 2 2 2 3 3 2 1
3 4 4 3 2

output
2

题意&解法

大意是给一个模板图形B，在图形A中找和B一致的图形块（每列的最高高度相同），为了尽可能多匹配，可以将B上下平移。这个题可以转化为字符串匹配的问题，我的第一个想法是把高度数组当做字符串直接匹配，但是B可以上下平移，结合1e9的高度范围枚举高度匹配显然不现实。再观察题目，在A中寻找B实际上找的是B的顶部形状，这时候将原数组转化为差分数组就可以表示图形的顶部形状了，且与B上下平移无关。转化完成之后B做模板串跑kmp，每当B的与A的某一段匹配成功时，答案计数增加，做失配处理，继续匹配至A串结尾。

贴代码

#include<iostream>
#include<sstream>
#include<cstdio>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<cctype>
#define N 200010
#define M 100010
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
const ll MOD=1e9+7;
const ll INF=1e9+7;
using namespace std;
inline ll read();
//
int a[N],b[N];
int nxt[N];
//
void getnext(int n){//求出B串的next数组
    nxt[0]=-1;
    int j=nxt[0];
    int i=0;
    while(i<n)
    {
        if(j==-1||b[i]==b[j])
            nxt[++i]=++j;
        else
            j=nxt[j];
    }
}
//

//
int main()
{
    int n=read(),m=read();
    
    for(int i=0;i<n;i++)//A数组的差分
    {
        a[i]=read();
        if(i)   a[i-1]=a[i]-a[i-1];
    }
    for(int i=0;i<m;i++)//B数组的差分
    {
        b[i]=read();
        if(i)   b[i-1]=b[i]-b[i-1];
    }
    getnext(m-1);
    int ans=0;
    int i=0,j=0;
    while(i<n-1)//kmp
    {
        if(j==-1||a[i]==b[j])
        {
            i++;j++;
            if(j==m-1)//成功匹配时，ans++，继续匹配
            {
                ans++;
                j=nxt[j];
            }
        }
        else j=nxt[j];
    }
    if(m==1)    ans++;//当m=1时，显然对于每个列都能符合条件，但是m=1时没有差分数组，故需要特判
    printf("%d\n",ans);

	return 0;
}

inline ll read(){
    ll p=1,ans=0;
    char ch=getchar();
    while(ch<48||ch>57)
    {
        if(ch=='-')    p=-1;
        ch=getchar();
    }
    while(ch>=48&&ch<=57)
    {
        ans=(ans<<3)+(ans<<1)+ch-48;
        ch=getchar();
    }

    return ans*p;
}
//