Codeforces 653A: Bear and Three Balls(技巧,水)
来源:互联网 发布:网易smtp服务器 端口 编辑:程序博客网 时间:2024/04/20 06:52
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 sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5and 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 sizes18, 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 <stdio.h>#include <string.h>int main(){int n;int flag[1010];memset(flag,0,sizeof(flag));int x;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&x);flag[x]=1;}for(int i=0;i<1010;i++){if(flag[i]==1&&flag[i+1]==1&&flag[i+2]==1){printf("YES\n");return 0;}}printf("NO\n");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 653 A. Bear and Three Balls
- 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 653 A Bear and Three Balls】
- 【codeforces 653A】Bear and Three Balls
- 【CodeForces】653A - Bear and Three Balls(计数)
- A. Bear and Three Balls CodeForces 653A
- 【CodeForces 635A】 Bear and Three Balls
- Codeforces 653A Bear and Three Balls【水题】
- Codeforces 653A Bear and Three Balls 【水题】
- CodeForces 653A Bear and Three Balls 暑期小练习
- 【codeforces】Bear and Three Balls(sort)
- Study TypeScript《1、基础数据类型》
- Oracle导入大数据
- 137. Single Number II
- Leetcode-70. Climbing Stairs
- activity去掉标题和状态栏
- Codeforces 653A: Bear and Three Balls(技巧,水)
- Web 端 URL 的处理
- C++设计模式——单例模式
- 事务概述
- JavaScript强化教程-列表的动态增加元素
- PL/SQL-存储过程、函数
- Xms Xmx PermSize MaxPermSize的含义
- web.xml加载顺序
- jq,js的ajax中调用$(this)