Codeforces #371(Div.2)B. Filya and Homework【思维】
来源:互联网 发布:分时量比曲线源码 编辑:程序博客网 时间:2024/06/12 21:14
Today, hedgehog Filya went to school for the very first time! Teacher gave him a homework which Filya was unable to complete without your help.
Filya is given an array of non-negative integers a1, a2, ..., an. First, he pick an integerx and then he adds x to some elements of the array (no more than once), subtract x from some other elements (also, no more than once) and do no change other elements. He wants all elements of the array to be equal.
Now he wonders if it's possible to pick such integer x and change some elements of the array using thisx in order to make all elements equal.
The first line of the input contains an integer n (1 ≤ n ≤ 100 000) — the number of integers in the Filya's array. The second line containsn integers a1, a2, ..., an (0 ≤ ai ≤ 109) — elements of the array.
If it's impossible to make all elements of the array equal using the process given in the problem statement, then print "NO" (without quotes) in the only line of the output. Otherwise print "YES" (without quotes).
51 3 3 2 1
YES
51 2 3 4 5
NO
In the first sample Filya should select x = 1, then add it to the first and the last elements of the array and subtract from the second and the third elements.
题目大意:
给你一个长度为n的序列,问你能否找到一个值x,使得序列中的任意数值可以-x或者+x的情况下,使得序列中的数最终变成相同的数。
思路:
分类讨论:
①如果序列中的数字的种类大于了3,那么显然不可能得到期望序列,即输出NO
②如果序列中的数字的种类小于等于2,那么显然一定可以得到期望序列,即输出YES
③如果序列中的数字的种类邓雨了3,那么最小的数字加上最大的数字等于中间值的二倍,明显也是YES的情况,否则为NO。
Ac代码:
#include<stdio.h>#include<string.h>#include<algorithm>#include<map>using namespace std;int a[1000050];int b[1000050];int main(){ int n; while(~scanf("%d",&n)) { map<int ,int >s; int cont=1; int contz=0; for(int i=0;i<n;i++) { scanf("%d",&a[i]); if(s[a[i]]==0) { s[a[i]]=cont++; b[contz++]=a[i]; } } sort(b,b+contz); if(cont>4) { printf("NO\n");fflush(stdout); } else { if(cont==4) { if(b[0]+b[2]==b[1]*2) { printf("YES\n");fflush(stdout); } else { printf("NO\n");fflush(stdout); } } if(cont==3||cont==2) { printf("YES\n");fflush(stdout); } } }}
- Codeforces #371(Div.2)B. Filya and Homework【思维】
- Codeforces Round #371 (Div. 2) B-Filya and Homework【思维】
- Codeforces Round #371 (Div. 2)B. Filya and Homework
- Codeforces 371B - Filya and Homework(思维)
- Codeforces Round #371 (Div. 2) B. Filya and Homework
- Codeforces Round #371 (Div. 2) B. Filya and Homework
- Codeforces Round #371 (Div. 2)B. Filya and Homework
- Codeforces Round #371 (Div. 2) B. Filya and Homework(水题 分类讨论)
- Codeforces Round #371 (Div. 2) B. Filya and Homework(水题)
- codeforces#371 B.Filya and Homework
- Codeforces Round #371 (Div. 2) B. Filya and Homework STL(map or set)
- Filya and Homework(CF #371 Div. 2)
- codeforces 714B Filya and Homework (水)
- CodeForces 714B. Filya and Homework(模拟)
- B. Filya and Homework
- CF #371 div2 B. Filya and Homework
- Codeforces Problem 714B Filya and Homework(分类讨论)
- CodeForces 712D Filya and Homework
- lightoj 1110 - An Easy LCS (LCS输出路径)
- [Javascript]对象数组排序
- [编程题]字符串分隔
- 详解GPS欺骗:针对导航系统的「致命攻击」
- Mat类型中的CV_8UC3、CV_32FC3以及对应的迭代器模板参数Vec3b,Vec3f的一点自己的理解
- Codeforces #371(Div.2)B. Filya and Homework【思维】
- IDEA git github操作
- 面试装13大法合集
- java不同数据类型在内存中的存储方式
- andorid 自定义View 命名空间 长话短说
- iOS 制作圆形图片
- 双向循环链表——STL迭代器
- iOS10适配问题
- [LeetCode] 166. Fraction to Recurring Decimal