Submission #3751181

---

Source Code Expand

#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
inline void read(int &x) {
	x=0; char c=getchar(); int f=1;
	while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
	while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
inline ui R() {
	static ui seed=416;
	return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
const int N = 666666;
void GG(){puts("No");exit(0);}
int n,a[N];
int main() {
	read(n);rep(i,1,n)read(a[i]);
	int mx=0;rep(i,1,n)mx=max(mx,a[i]);
	int cnt=0,cnt1=0;
	rep(i,1,n)if(a[i]==mx)cnt++;
	else if(a[i]==mx-1)cnt1++;else GG();
	if(cnt==n&&mx==n-1){puts("Yes");return 0;}
	if(1+cnt1<=mx&&mx<=cnt/2+cnt1)puts("Yes");else GG();
	return 0;
}

Submission Info

Judge Result