B - B CodeForces - 714B

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 integer x 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 this x 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 contains n 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).

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

题目大意：

给出一个n
下面为n个数据
求 能不能有一个数x使得数组中的数都相等
看样例一： x为1；

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int a[120000];
    int n;
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a+1, a+n+1);
    int sum = unique(a+1, a+1+n) - a - 1;
    if(sum>3) printf("NO\n");
    else if(sum==3)
    {
   
        if(a[1]+a[3]==2*a[2])  printf("YES\n");
        else printf("NO\n");
    }
    else printf("YES\n");
    return 0;
}