CodeForces - 471D

D. MUH and Cube Walls
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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 ai (1 ≤ ai ≤ 109) — the heights of the towers in the bears' wall. The third line contains w integers bi (1 ≤ bi ≤ 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
Copy
13 5
2 4 5 5 4 3 2 2 2 3 3 2 1
3 4 4 3 2
output
Copy
2
Note

The picture to the left shows Horace's wall from the sample, the picture to the right shows the bears' wall. The segments where Horace can "see an elephant" are in gray.


这是一道KMP模板题,但又有所不同,匹配的是差值相同的连续串。设原串a,b,c,d模式串是 e,f,g,h.

匹配的条件是a-e=b-f=c-g=d-h,即a-b=e-f, b-c=f-g,  c-d=g-h.所以完全匹配的是两个串相邻数的差值即可,我把差值分别存起来,作为原串和模式串,其余的就是kmp模板了。*******就是当匹配类型是int 型而不是一般的char时,当str[]={0,0,0,0,0},mo[]={0, 0}答案是4但程序output为1,所以,我把里面的0全换为-1了。

#include<bits/stdc++.h>
const int maxn=200005;
using namespace std;
int str[maxn];
int mo[maxn];
int a[maxn];
int b[maxn];
int Next[maxn];
int n,m;
void getNext()
{
    int i=0;
    int j=-1;
    int len=m-1;
    while(i<len)
    {
        if(j==-1||mo[i]==mo[j])
        {
            i++;
            j++;
            Next[i]=j;
        }
        else j=Next[j];
    }
}
int kmp()
{
    int i=0;
    int j=0;
    int ans=0;
    int l1=n-1;
    int l2=m-1;
    while(i<l1)
    {
        if(j==-1||(mo[j]==str[i]))
        {
            i++;
            j++;
        }
        else j=Next[j];
        if(j==l2) ans++;
    }
    return ans;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(str,0,sizeof(str));
        memset(mo,0,sizeof(mo));
        for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
        for(int i=1;i<n;i++)
        {
           str[i-1]=a[i]-a[i-1];
           if(str[i-1]==0) str[i-1]=-1;
        }
        for(int i=0;i<m;i++)
        scanf("%d",&b[i]);
        for(int i=0;i<m;i++)
        {
           mo[i-1]=b[i]-b[i-1];
           if(mo[i-1]==0) mo[i-1]=-1;
        }
        if(m==1)
        {
           printf("%d\n",n);
           continue;
        }
        Next[0]=-1;
        getNext();
        printf("%d\n",kmp());

    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
CodeForces - 616D是一个关于找到一个序列中最长的第k好子段的起始位置和结束位置的问题。给定一个长度为n的序列和一个整数k,需要找到一个子段,该子段中不超过k个不同的数字。题目要求输出这个序列最长的第k好子段的起始位置和终止位置。 解决这个问题的方法有两种。第一种方法是使用尺取算法,通过维护一个滑动窗口来记录\[l,r\]中不同数的个数。每次如果这个数小于k,就将r向右移动一位;如果已经大于k,则将l向右移动一位,直到个数不大于k。每次更新完r之后,判断r-l+1是否比已有答案更优来更新答案。这种方法的时间复杂度为O(n)。 第二种方法是使用枚举r和双指针的方法。通过维护一个最小的l,满足\[l,r\]最多只有k种数。使用一个map来判断数的种类。遍历序列,如果当前数字在map中不存在,则将种类数sum加一;如果sum大于k,则将l向右移动一位,直到sum不大于k。每次更新完r之后,判断i-l+1是否大于等于y-x+1来更新答案。这种方法的时间复杂度为O(n)。 以上是两种解决CodeForces - 616D问题的方法。具体的代码实现可以参考引用\[1\]和引用\[2\]中的代码。 #### 引用[.reference_title] - *1* [CodeForces 616 D. Longest k-Good Segment(尺取)](https://blog.csdn.net/V5ZSQ/article/details/50750827)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^koosearch_v1,239^v3^insert_chatgpt"}} ] [.reference_item] - *2* [Codeforces616 D. Longest k-Good Segment(双指针+map)](https://blog.csdn.net/weixin_44178736/article/details/114328999)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^koosearch_v1,239^v3^insert_chatgpt"}} ] [.reference_item] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值