CodeForces 653A Bear and Three Balls

原创 2016年05月30日 12:54:19
O - O
Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

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 45 and 3, or balls with sizes 9091 and 92. But he can't choose balls with sizes 55and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 3031 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

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
题意:给出n个数,问是否存在三个连续的数。。。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,i,a[55],b[1100];
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			b[a[i]]=1;
		}
		int flag=0;
		for(i=0;i<1001;i++)
		{
			if(b[i]==1&&b[i+1]==1&&b[i+2]==1)
			{
				printf("YES\n");
				flag=1;
				break;
			}
		}
		if(flag==0)
		printf("NO\n");
	}
	return 0;
 } 


版权声明:本文为博主原创文章,转载请注明出处。

相关文章推荐

Codeforces 653A: Bear and Three Balls(技巧,水)

A. Bear and Three Balls time limit per test 2 seconds memory limit per test 256 megabyte...

CodeForces 653 A. Bear and Three Balls——(IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2))

STL。。。

【CodeForces - 653A】Bear and Three Balls(sort)

题目A. Bear and Three Balls time limit per test2 seconds memory limit per test256 megabytes inputst...

【codeforces 653 A Bear and Three Balls】

Bear and Three BallsDescription Limak is a little polar bear. He has n balls, the i-th ball has siz...

Bear and Three Balls CodeForces - 653A

Limak is a little polar bear. He has n balls, the i-th ball has size ti.Limak wants to give one ball...

【codeforces】Bear and Three Balls

A. Bear and Three Balls time limit per test  2 seconds memory limit per test  256 megaby...

codeforces IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) A. Bear and Three Balls

A. Bear and Three Balls time limit per test 2 seconds memory limit per test 256 megabytes input...

codeforces 653E. Bear and Forgotten Tree 2 连通问题

E. Bear and Forgotten Tree 2 time limit per test 2 seconds memory limit per test 256 meg...

CodeForces 653E Bear and Forgotten Tree 2

题意:给出n个点,现在有m对点之间不能连边,现在问能否保证构造出一棵结点1的度为k的树。 思路:如果没有结点1必须度数为k这个限制,只需要dfs一下看是否联通就行。 现在考虑这个限制,只需要不考虑...

Codeforces 653C - Bear and Up-Down 暴力

C. Bear and Up-Down time limit per test 2 seconds memory limit per test 256 megabytes input st...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)