Submission #1360822

---

Source Code Expand

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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
template<class T>bool chmin(T&a,const T&b){return a>b?(a=b,true):false;}
template<class T>bool chmax(T&a,const T&b){return a<b?(a=b,true):false;}

ll nextInt() {
  int x; cin >> x; return x;
}

const int MAX_N = 100000 + 10;
int a[MAX_N];
int N;

bool f(int N, int M) {
  if (N <= 0 || M <= 0) return false;
  if (M == 1) return true;
  if (M == N - 1) return true;
  if (N >= 2 * M) 
    return true;
  else
    return false;
}

bool solve() {
  if (a[N-1] - a[0] >= 2) return false;
  if (a[0] == a[N-1]) {
    return f(N,  a[0]);
  } else {
    int m = 0;
    REP(i, N) {
      if (a[0] == a[i]) m++;
    }
    return f(N-m, 1+a[0]-m);
  }
}

int main2() {
  N = nextInt();
  REP(i, N) a[i] = nextInt();
  sort(a, a + N);

  bool res = solve();
  cout << (res ? "Yes":"No") << endl;

  return 0;
}

int main() {
  for (;!cin.eof();cin>>ws) main2();
  return 0;
}

Submission Info

Judge Result