Submission #1991437

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define si scanf
#define so printf
#define N 100100
#define M 
#define INF  
template<typename TP>inline bool rd(TP& r)
{
	r=0;
	char tmp=getchar();
	while(tmp<'0'||tmp>'9')
	{
		if(tmp==EOF)
			return 0;
		tmp=getchar();
	}
	while('0'<=tmp&&tmp<='9')
	{
		r=(r<<3)+(r<<1)+tmp-'0';
		tmp=getchar();
	}
	return 1;
	
} 
int n;
int a[N];
int main()
{
	rd(n);
	for(int i=1;i<=n;++i)
		rd(a[i]);
	sort(a+1,a+n+1);
	if(a[n]-a[1]>1)
	{
		so("No\n");
		return 0;
	}
	if(a[n]==a[1])
	{
		if((n/2>=a[1]&&n>=2)||n-1==a[1])//分别对应着没有独苗和都是独苗 
			so("Yes\n");
		else
			so("No\n");
		return 0;
	}
	int ns;
	for(ns=1;ns+1<=n;++ns)
		if(a[ns+1]!=a[ns])
			break;
	if(ns+(n-ns)/2>=a[n]&&(n-ns)>=2)
		so("Yes\n");
	else
		so("No\n");
	return 0;
} 

Submission Info

Judge Result