CodeForces 653 A. Bear and Three Balls
2016-05-30 08:52
369 查看
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 33differ
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
Output
Input
Output
Input
Output
YES
题意:送三个球给朋友,这三个球最大差值不能超过2,但大小也不能一样,
思路:排序后去重;
代码如下:
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[1010];
int n;
while(scanf("%d",&n)!=EOF)
{
int i;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
int x=unique(a+1,a+1+n)-(a+1);
bool l=true;
for(i=1;i<=x-2;i++)
{
if(a[i+2]-a[i]<=2)
{
printf("YES\n");
l=false;
break;
}
}
if(l==true)
printf("NO\n");
}
}
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 33differ
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
题意:送三个球给朋友,这三个球最大差值不能超过2,但大小也不能一样,
思路:排序后去重;
代码如下:
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[1010];
int n;
while(scanf("%d",&n)!=EOF)
{
int i;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
int x=unique(a+1,a+1+n)-(a+1);
bool l=true;
for(i=1;i<=x-2;i++)
{
if(a[i+2]-a[i]<=2)
{
printf("YES\n");
l=false;
break;
}
}
if(l==true)
printf("NO\n");
}
}
相关文章推荐
- 第十四周-阅读程序-1
- TCP : two different sockets sharing a port?
- Shell基础学习(一) Shell简介
- B. Mr. Kitayuta's Colorful Graph,二维并查集!
- block有关知识
- oracle 12.1.0.2 新特性高级索引压缩
- gridview安卓实现单行多列横向滚动
- 在大学读过的书【记录篇】
- JAVA读入挂
- maven新建项目时报错
- LeetCode 046 Permutations
- 字符串函数总结
- NYOJ 引水工程---1239
- jsp的简单总结(一)
- 每天一个Linux命令(32)date命令
- sql server 2012 链接服务器不能链接sql server 2000的解决方案
- PO、BO、VO等后台对象模型总结
- Android Fragment 深度解析
- Widget Factory
- 144. Binary Tree Preorder Traversal