CodeForces 761B Dasha and friends
来源:互联网 发布:智能电视点播软件 编辑:程序博客网 时间:2024/05/17 05:04
题目链接:http://codeforces.com/contest/761/problem/B
题意:给一个圆环,告诉你两个序列a,b,a[i],b[i]分别表示在圆环上的位置,现问你,能否通过移动整体一个数组使得他的两个序列相等
解析:这和Gym - 100502H Clock Pictures这道题很像,不过由于这题的数据规模很小,所以我是直接枚举差值,模拟移动的,如果数据规模大的话,可以存差值,采用kmp匹配的方式
#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <cstring>#include <queue>#include <map>using namespace std;const int maxn = 1e6+100;const int inf = 0x7fffffff;int a[maxn];int b[maxn];int main(void){ int n,l; scanf("%d %d",&n,&l); for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int i=0;i<n;i++) scanf("%d",&b[i]); int flag = 0; for(int i=0;i<n;i++) { int cnt = a[0]-b[i]; int judge = 1; for(int j=0;j<n;j++) { if((b[(j+i)%n]+cnt+l)%l!=a[j]) { judge = 0; break; } } if(judge) { flag = 1; puts("YES"); break; } } if(!flag) puts("NO"); return 0;}
0 0
- 【codeforces 761B】Dasha and friends
- Codeforces 761B-Dasha and friends
- CodeForces 761B Dasha and friends
- 761B Dasha and friends
- Codeforces-Round 394#B-Dasha and friends
- B. Dasha and friends
- B. Dasha and friends
- Codeforces Round #394 (Div. 2)(A. Dasha and Stairs,B. Dasha and friends,C. Dasha and Password)
- 文章标题 coderforces 761B : Dasha and friends(KMP)
- CF761 B. Dasha and friends(水题)
- Codeforces Round #394(Div. 2)B. Dasha and friends【思维+暴力】
- Codeforces Round #394 (Div. 2) B. Dasha and friends —— 暴力 or 最小表示法
- Codeforces761B Dasha and friends
- Codeforces Round #394 (Div. 2)Dasha and friends
- 【CODEFORCES】 B. Friends and Presents
- Codeforces761B. Dasha and friends (KMP)
- 【codeforces 761A】Dasha and Stairs
- Codeforces 761C DaSha and Password 暴力
- Find Mode in Binary Search Tree
- usb中的endpoint(端点)和传输模式
- jason by gson复习
- 下拉菜单控件JComboBox的使用
- ANDROID STUDIO系列教程四--GRADLE基础
- CodeForces 761B Dasha and friends
- ListView显示多种布局样式
- myeclipse快捷键大全
- 文件和表单的简单上传
- 素数求和问题
- java初中级工程师面试笔试题目及心得(全部实战经验)
- JavaScript中函数的三种定义方法
- HDU 1242 Rescue (BFS+优先队列)
- numpy_sheet