Filya and Homework CodeForces - 714B
2018-02-04 20:39
1401 查看
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.
Input
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.
Output
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).
Example
Input
Output
Input
Output
Note
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.
点我!!!!
unique()去重函数运用
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.
Input
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.
Output
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).
Example
Input
5 1 3 3 2 1
Output
YES
Input
5 1 2 3 4 5
Output
NO
Note
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.
点我!!!!
unique()去重函数运用
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; const int N = 100005; int arr ; int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&arr[i]); sort(arr,arr+n); int type=unique(arr,arr+n)-arr; if(type<3||type==3&&arr[1]-arr[0]==arr[2]-arr[1]) printf("YES\n"); else printf("NO\n"); return 0; }
相关文章推荐
- Filya and Homework CodeForces - 714B
- B. Filya and Homework
- Codeforces Round #371 (Div. 2) B. Filya and Homework
- codeforces --- Round #250 (Div. 2) A. The Child and Homework
- CF #371 div2 B. Filya and Homework
- Codeforces Round #371 (Div. 2) B. Filya and Homework(水题)
- Filya and Homework(CF #371 Div. 2)
- Codeforces Round #371 (Div. 2) B. Filya and Homework(水题 分类讨论)
- codeforces#371 B.Filya and Homework
- 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(unique函数的运用)
- CodeForces 437 A. The Child and Homework
- Codeforces 584 C. Marina and Vasya (Codeforces Round #324 (Div. 2))
- codeforces 793B - Igor and his way to work(bfs)
- CodeForces 780A Andryusha and Socks【水题】
- Codeforces 599D:Spongebob and Squares
- codeforces——492A——Vanya and Cubes
- CodeForces 734D:Anton and Chess(模拟?)