CodeForces 471D MUH and Cube Walls(KMP)
来源:互联网 发布:115浏览器for mac 编辑:程序博客网 时间:2024/05/17 15:57
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".
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.
Print the number of segments in the bears' wall where Horace can "see an elephant".
13 52 4 5 5 4 3 2 2 2 3 3 2 13 4 4 3 2
2
解题思路:无论墙的高度如何变化,两个数之间的差值是不会变的。所以我们可以先预处理出序列相邻两个数的差值,然后在进行KMP匹配,匹配次数即为答案。
代码如下:
#include <bits/stdc++.h>#define MEM(arr,val) memset(arr,val,sizeof(arr))const int maxn = 200005;int next[maxn];int s[maxn],t[maxn];int n,w;int kmp(){ MEM(next,-1); next[1] = 0; int ans = 0; for(int i = 2,j = 0;i < w;i++){ while(j > 0 && s[j + 1] != s[i]) j = next[j]; if(s[j + 1] == s[i]) j += 1; next[i] = j; } for(int i = 1,j = 0;i < n;i++){ while(j > 0 && s[j + 1] != t[i]) j = next[j]; if(s[j + 1] == t[i]) j += 1; if(j == w - 1){ ans++; j = next[j]; } } return ans;}int main(){ int last,cur; scanf("%d %d",&n,&w); scanf("%d",&last); for(int i = 1;i < n;i++){ scanf("%d",&cur); t[i] = cur - last; last = cur; } scanf("%d",&last); for(int i = 1;i < w;i++){ scanf("%d",&cur); s[i] = cur - last; last = cur; } printf("%d\n",w == 1 ? n : kmp()); return 0;}
- CodeForces 471D MUH and Cube Walls(KMP匹配)
- CodeForces 471D MUH and Cube Walls(KMP)
- codeforces 471D MUH and Cube Walls kmp
- 【CodeForces】471D MUH and Cube Walls KMP
- CodeForces 471D MUH and Cube Walls KMP
- Codeforces 471D MUH and Cube Walls【思维+KMP】
- 471D - MUH and Cube Walls (KMP)
- codeforces MUH and Cube Walls (kmp)
- CodeForces 471D MUH and Cube Walls
- 【CODEFORCES】 D. MUH and Cube Walls
- 【CodeForces】471D MUH and Cube Walls KMP或者字符串HASH
- CodeForces 471D MUH and Cube Walls KMP算法+串的取差性质
- Codeforces Round #269 (Div. 2)(D. MUH and Cube Walls(KMP))
- Codeforces #269 (Div. 2)D. MUH and Cube Walls(数据结构:KMP)
- Codeforces Round #269 (Div. 2) D题 MUH and Cube Walls(KMP)
- Codeforces #269 (Div. 2)D. MUH and Cube Walls(KMP)
- 【字符串hash】 codeforces 471D MUH and Cube Walls
- Codeforces 471D MUH and Cube Walls 题解
- SDUT2143图结构练习——最短路径
- HDU-5833-Zhu and 772002(高斯消元)
- 关于React Native 报Export declarations are not supported by current JavaScript version错误的解决问题
- 理解OAuth 2.0
- HDU 1735 统计数字(贪心)
- CodeForces 471D MUH and Cube Walls(KMP)
- 二叉树之中序遍历(递归和非递归两种遍历)
- Hdu 5833 Zhu and 772002(高斯消元解异或方程组)
- 21分钟 MySQL 入门教程
- springMVC各个包下的作用
- (转)Linux NTP配置详解 (Network Time Protocol)
- 绝句 自省
- 面向对象设计的八个原则
- 总结一下Android中主题(Theme)的正确玩法