Algorithm

A. Yaroslav and Permutations
time limit per test
2 seconds
memory limit per test
256 megabytes
problem link-  https://codeforces.com/contest/296/problem/A
input
standard input
output
standard output

Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time.

Help Yaroslav.

Input

The first line contains integer n (1 ≤ n ≤ 100) — the number of elements in the array. The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the array elements.

Output

In the single line print "YES" (without the quotes) if Yaroslav can obtain the array he needs, and "NO" (without the quotes) otherwise.

Examples
input
Copy
1
1
output
Copy
YES
input
Copy
3
1 1 2
output
Copy
YES
input
Copy
4
7 7 7 7
output
Copy
NO
Note

In the first sample the initial array fits well.

In the second sample Yaroslav can get array: 1, 2, 1. He can swap the last and the second last elements to obtain it.

In the third sample Yarosav can't get the array he needs.

 

 

 

 

 

 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int const N = 1e3 + 1;
int n, fr[N];

int main() {
  scanf("%d", &n);
  for(int i = 0, tmp; i < n; ++i) {
    scanf("%d", &tmp);
    ++fr[tmp];
  }

  for(int i = 0; i < N; ++i) {
    if(n % 2 == 0 && fr[i] > n / 2) {
      puts("NO");
      return 0;
    }

    if(n % 2 == 1 && fr[i] > n / 2 + 1) {
      puts("NO");
      return 0;
    }
  }

  puts("YES");

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
1
1

Output

x
–
+
cmd
YES
Advertisements

Demonstration

Codeforces Solution-Yaroslav and Permutations-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+