Codeforces(653A)
2016-08-14 18:43
351 查看
<span style="font-family: Arial, Helvetica, sans-serif;">#include<iostream></span>
using namespace std; int size_balls[55]={0}; int hash_size[1005]={0}; int main() { int n; cin>>n; int bsize; for(int i=1;i<=n;++i){ cin>>bsize; size_balls[i]=bsize; hash_size[bsize]=1; } int cur=0; for(int i=1;i<=n;++i){ cur=size_balls[i]; if((hash_size[cur+1]==1) && (hash_size[cur+2]==1)) { cout<<"YES"<<endl; return 0; } } cout<<"NO"<<endl; return 0; }
相关文章推荐
- 【Codeforces】-653A-Bear and Three Balls
- 【CodeForces】653A - Bear and Three Balls(计数)
- 【CodeForces】[653A]Bear and Three Balls
- 【codeforces 653A】Bear and Three Balls
- CodeForces 653A【水】
- 【CodeForces - 653A】Bear and Three Balls(sort)
- codeforces 93 div2 D题 - kmp- 3
- 【Codeforces】 21D Traveling Graph
- codeforces 650D. Zip-line 线段树
- CodeForces 707D Persistent Bookcase (操作建树DFS|主席树+主席树)
- 【codeforces 782B】The Meeting Place Cannot Be Changed(二分)
- codeforces 550c (数学)
- Codeforces 46F Hercule Poirot Problem
- [刷题笔记]codeforces 44B - 通过判定减少循环层数。
- CodeForces 342B Xenia and Spies
- codeforces-1B-Spreadsheets( C++ && PHP && 字符串操作 && 数学逻辑 )
- CodeForces 687A NP-Hard Problem(二分图)
- CodeForces - 149D Coloring Brackets 详细题解(递归区间DP+dfs染色,好题)
- Codeforces 840B(DFS)
- codeforces 940E Cashback 有趣的dp