Bear and Three Balls
来源:互联网 发布:约瑟夫环 java 递归 编辑:程序博客网 时间:2024/04/29 15:54
Bear and Three Balls
Description
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.
Input
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.
Output
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).
Sample Input
418 55 16 17
YES
640 41 43 44 44 44
NO
85 972 3 4 1 4 970 971
YES
#include<stdio.h>
#include<stdlib.h>#include<algorithm>
using namespace std;
int main()
{
int m,i,j=0,n=0,a[1100],b[1100];
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d",&a[i]);
sort(a,a+m);
for(i=0;i<m;i++)
{
if(a[i]!=a[i+1])
{
b[j]=a[i];
j++;
}
}
for(i=0;i<j;i++)
{
if(b[i]+1==b[1+i]&&b[i+1]+1==b[i+2])
{
n=1;
printf("YES\n");
break;
}
}
if(!n)
printf("NO\n");
return 0;
}
- 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
- CodeForces 653A Bear and Three Balls
- 【Codeforces】-653A-Bear and Three Balls
- structs2拦截器原理
- 做个简单的程序日志记录文件
- 华为路由器配置简单NAT实例
- kafka深度解析
- floor random 随机抽奖
- Bear and Three Balls
- uc/os-iii学习笔记-中断管理
- JEECG 3.6.5版本发布,企业级JAVA快速开发平台
- ImageLoader的简单分析(五)
- 欧拉回路路径求解
- React Native 学习笔记(二)
- 常用宏定义
- 阿里腾讯图谱“智能鉴黄”技术哪家强?
- poj3295