Petya and Staircases CodeForces
来源:互联网 发布:最全的淘宝隐藏券网站 编辑:程序博客网 时间:2024/05/07 06:24
Petya and Staircases
CodeForces - 362BLittle boy Petya loves stairs very much. But he is bored from simple going up and down them — he loves jumping over several stairs at a time. As he stands on some stair, he can either jump to the next one or jump over one or two stairs at a time. But some stairs are too dirty and Petya doesn't want to step on them.
Now Petya is on the first stair of the staircase, consisting of n stairs. He also knows the numbers of the dirty stairs of this staircase. Help Petya find out if he can jump through the entire staircase and reach the last stair numbern without touching a dirty stair once.
One has to note that anyway Petya should step on the first and last stairs, so if the first or the last stair is dirty, then Petya cannot choose a path with clean steps only.
The first line contains two integers n andm (1 ≤ n ≤ 109,0 ≤ m ≤ 3000) — the number of stairs in the staircase and the number of dirty stairs, correspondingly. The second line containsm different space-separated integersd1, d2, ..., dm (1 ≤ di ≤ n) — the numbers of the dirty stairs (in an arbitrary order).
Print "YES" if Petya can reach stair numbern, stepping only on the clean stairs. Otherwise print "NO".
10 52 4 8 3 6
NO
10 52 4 5 7 9
YES
思路:因为最多能越过两个台阶,那么如果有连着的超过两个的脏台阶那么就一定跳不过去了,比如连着3个4个。。。。所以只需要判断是否有超过两个的连续的脏台阶就可以了
code:
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int main(){int n,m;cin >> n >> m;int a[3010];int i;for(i = 0; i < m; i++) cin >> a[i];sort(a,a+m);if(a[0] == 1 || a[m-1] == n){cout << "NO" << endl;return 0;}int num = 0;for(i = 1; i < m; i++){if(a[i] == a[i-1]+1){num++;}else{if(num >= 2){cout << "NO" << endl;return 0;}else{num = 0;}}}if(num >= 2) cout << "NO" << endl;//注意!!!最后退出循环后还是要判断一下num个数,因为有可能整个台阶序列都是连续的,就不会中途停止了,只能等循环结束在输出NO else cout << "YES" << endl;return 0;}
- Petya and Staircases CodeForces
- Codeforces 362B Petya and Staircases
- CodeForces 362B Petya and Staircases
- CodeForces 362B Petya and Staircases
- Codeforces 362B. Petya and Staircases
- B. Petya and Staircases
- Codeforces Round #212 (Div. 2) B. Petya and Staircases
- Codeforces Round #212 (Div. 2) B. Petya and Staircases
- Codeforces Round #212 (Div. 2) A. Two Semiknights Meet /B. Petya and Staircases
- B. Petya and Staircases----思维题
- 【CodeForces】A. Petya and Strings
- codeforces 111C Petya and Spiders
- Codeforces 66E - Petya and Post
- CodeForces 111B - Petya and Divisors
- CodeForces 111B Petya and Divisors
- 【codeforces 111C】 Petya and Spiders
- 【CodeForces】[66A]Petya and Java
- 【CodeForces】[66B]Petya and Countryside
- 实现启动app,首页倒计时跳转,也可点击按钮进行跳转
- 使用Nginx实现HTTPS双向验证的方法
- 图形界面扩容缩容acfs文件系统
- spring mvc 5.0 RequestParam详解 06
- H5-12人牛牛架设教程
- Petya and Staircases CodeForces
- js 按照特定日期格式获取当前时间
- org.apache.commons.fileupload.FileUploadBase$IOFileUploadException: Processing of multipart/form-dat
- 如何解析DICOM文件中的Pixel Data ?
- ARM GCC 内嵌(inline)汇编手册
- Python的闭包(Closure)与惰性计算(Lazy Evaluation)
- 启动欢迎页面和广告图片轮转
- jfinal集成swagger
- io流处理的核心类的详解