# CodeForces 653A Bear and Three Balls 暑期小练习

178人阅读 评论(0)

Bear and Three Balls

Description

Limakis a little polar bear. He has n balls,the i-th ball has size ti.

Limakwants to give one ball to each of his three friends. Giving gifts isn'teasy — 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.

Forexample, Limak can choose balls with sizes 45 and 3,or balls with sizes 9091 and 92.But he can't choose balls with sizes 55and 6 (twofriends would get balls of the same size), and he can't choose balls with sizes 3031 and 33 (becausesizes 30 and 33 differby more than 2).

Yourtask is to check whether Limak can choose three balls that satisfy conditionsabove.

Input

Thefirst line of the input contains one integer n (3 ≤ n ≤ 50) —the number of balls Limak has.

Thesecond line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 1000)where ti denotesthe size of the i-th ball.

Output

Print"YES" (without quotes) if Limak can choose three balls of distinctsizes, such that any two of them differ by no more than 2.Otherwise, print "NO" (without quotes).

Sample Input

Input

4
18 55 16 17

Output

YES

Input

6
40 41 43 44 44 44

Output

NO

Input

8
5 972 3 4 1 4 970 971

Output

YES

第一次那么容易A CF的题目昂

/*=============================AC情况===============================*/
/*题目网址:   */
/*时间： */
/*心得：  */

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define G 1009

int MIN(int x,int y) {
return x<y? x:y;
}

int main() {
int n,t,min,flag;
int wqs[G];
while(scanf("%d",&n)!=EOF) {
min=10000;
memset(wqs,0,sizeof(wqs));
for(int j=0; j<n; j++) {
scanf("%d",&t);
min=MIN(t,min);
wqs[t]=1;//该数字出现过
}
for(int j=min; j<G-1; j++) {
if(wqs[j]&&wqs[j+1]&&wqs[j+2]) {//存在三个连续的数字
flag=1;
break;
}
flag=0;
}
if(flag)
puts("YES");
else
puts("NO");
}
return 0;
}

/*********************************测试数据*********************************

**************************************************************************/


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：88903次
• 积分：5081
• 等级：
• 排名：第5829名
• 原创：439篇
• 转载：1篇
• 译文：0篇
• 评论：12条