【Codeforces】-653A-Bear and Three Balls

最新推荐文章于 2023-08-06 13:10:43 发布

原创最新推荐文章于 2023-08-06 13:10:43 发布 · 511 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

学习之路同时被 2 个专栏收录

68 篇文章

订阅专栏

数学

64 篇文章

订阅专栏

本文探讨了一个关于选择三个特定大小球的问题，确保任意两个球的大小差异不超过2，并且大小各不相同。通过算法实现，对输入的球大小进行处理，判断是否能选出符合条件的三个球。

点击打开题目

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

   Examples
 
     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

Note

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<cstdio>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
	return a<b;
}
int main()
{
	int n;
	int a[55],b[55];
	while(~scanf("%d",&n))
	{
		int y=0;
		int x=1;
		for(int i=1;i<=n;i++)
			scanf("%d",&a[i]);
		sort(a+1,a+n+1,cmp);
		b[x]=a[1];
		for(int i=2;i<=n;i++)
		{
			if(a[i]!=a[i-1])
			{
				x++;
				b[x]=a[i];
			}
		}
		for(int i=1;i<x;i++)
		{
			if(b[i+1]-b[i]==1)
			{
				y++;
				if(y==2)
				{
					printf("YES\n");
					break;
				}
			}
			else
				y=0;
		}
		if(y!=2)
			printf("NO\n");
	}
	return 0;
}