Submission #1568544

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define dump(x) cerr<<#x<<"="<<x<<endl


int p,q;
int main(){
  int n;
  cin>>n;
  vector<int> a(n);
  vector<int> b(n);
  for(int i=0;i<n;i++){
    cin>>a[i];
    b[i]=a[i];
  }
  sort(b.begin(),b.end());
  b.erase(unique(b.begin(),b.end()),b.end());
  int N=b.size();

  int max=-1,min=INF;
  for(int i=0;i<n;i++){
    if(a[i]>max)max=a[i];
    if(a[i]<min)min=a[i];
  }
  bool flag=false;
  if(max==min){
    if(N==max || n/2>max){
      flag=true;
    }
  }

  for(int i=0;i<n;i++){
    if(a[i]==max)q++;
    else if(a[i]==min)p++;
  }
  if(max==min+1){
    if((N==max)&&(max>=p+(q+1)/2))flag=true;
  }
  flag ? cout<<"Yes"<<endl : cout<<"No"<<endl;
}

Submission Info

Judge Result