A bear and three boats

A bear and three boats

Crawling in process...Crawling failedTime Limit:2000MS    Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

Limak is a little polar bear. He has n balls, the i-th ball has sizet_i.

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 than2.

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 sizes30, 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 integerst₁, t₂, ..., t_n (1 ≤ t_i ≤ 1000) where t_i denotes the size of thei-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 than2. 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

题意：就是问你是否有连续的三个数;

代码：

#include<stdio.h>
int num[1001];
int main()
{
	int n,t;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d",&t);
		num[t]++;
	}
	for(int i=0;i<=1000;i++)
	{
	    if(num[i]&&num[i+1]&&num[i+2])
		{
			printf("YES\n");
			return 0;
		}
    }
	printf("NO\n");
	return 0;	
}
用sort也能做

代码：

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[55],b[55];
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
		}
		sort(a,a+n);
		b[0]=a[0];
		int t=1;//从1开始 
		for(int i=1;i<n;i++)//把经过sort排序后的a数组中相同的元素除去，则b数组中存的是经过排序后的不含有相同元素的数
		{
			if(a[i]!=a[i-1])
			{
				b[t++]=a[i];
			}
	         }
	    bool flag=0;
		for(int i=0;i<t-2;i++)
		{
			if(b[i+2]-b[i]<3)//也就是等于2
			{
				flag=1;
			    break;
			} 
			   
		}
		if(flag)
		  printf("YES\n");
		else
		  printf("NO\n");
	}
	return 0;
}