bears and three balls
来源:互联网 发布:pop的端口号 编辑:程序博客网 时间:2024/06/06 07:22
Limak is a little polar bear. He has n balls, the i-th ball has size ti.
Limak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy:
- No two friends can get balls of the same size.
- No two friends can get balls of sizes that differ by more than 2.
For example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33(because sizes 30 and 33 differ by more than 2).
Your task is to check whether Limak can choose three balls that satisfy conditions above.
The first line of the input contains one integer n (3 ≤ n ≤ 50) — the number of balls Limak has.
The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 1000) where ti denotes the size of the i-th ball.
Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes).
418 55 16 17
YES
640 41 43 44 44 44
NO
85 972 3 4 1 4 970 971
YES
In the first sample, there are 4 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 18, 16 and 17.
In the second sample, there is no way to give gifts to three friends without breaking the rules.
In the third sample, there is even more than one way to choose balls:
- Choose balls with sizes 3, 4 and 5.
- Choose balls with sizes 972, 970, 971.
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){int t;int a[55];int num[1005];while (~scanf("%d",&t)){memset(&a,0,sizeof(a));memset(&num,0,sizeof(num));for (int i = 0; i < t; ++i){scanf("%d",&a[i]);num[a[i]]++;}int flag = 0;for (int i = 0;i < 1000; ++i){if (num[i]&&num[i+1]&&num[i+2]){printf("YES");flag = 1;break;}}if (flag == 0)printf("NO");printf("\n");}return 0;}
还可以去个重 sort就可以了
- bears and three balls
- bears and three balls
- Bear and Three Balls
- Bear and Three Balls
- Bear and Three Balls
- Bear and Three Balls
- Bear and Three Balls
- Bear and Three Balls
- Bear and Three Balls
- Bear and Three Balls
- 【codeforces】Bear and Three Balls
- Bear and Three Balls CodeForces
- A. Bear and Three Balls
- acm Bear and Three Balls
- Codeforces 653A Bear and Three Balls
- codeforces->653A. Bear and Three Balls
- 【CodeForces】[653A]Bear and Three Balls
- CodeForces 653 A. Bear and Three Balls
- 37-2-3
- 求逆序数
- [Unity&精灵&对象]使用Instantiate,Resource.Load动态生成物体
- HTML5之SVG 2D入门9—蒙板及mask元素介绍与应用
- HDU 5818 Joint Stacks [栈]【模拟】
- bears and three balls
- Codeforces 761C Dasha and Password 【模拟】
- HTML5之SVG 2D入门10—滤镜的定义及使用
- libnuma.so.1()(64bit) is needed by MySQL-server-5
- HTML5之SVG 2D入门11—用户交互性(动画)介绍及应用
- LEETCODE--Construct the Rectangle
- 《黑客与画家》读书笔记
- 排序 HDU - 1106
- HTML5之SVG 2D入门12—SVG DOM及DOM操作介绍