#include<bits/stdc++.h>
using namespace std;
int compare (int a,int b) {
return a>b;
}
int main () {
int t,n,m,sum,i,j,f;
int a[11000];
scanf("%d",&t);
while(t--) {
scanf("%d",&n);
sum=0;
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
if(sum%2==1) {
printf("no\n");
continue;
}
for(i=1;i<=n;i++) {
sort(a+i,a+n+1,compare);
m=a[i];
if(m<0||m>n-i)
break;
a[i]=0;
for(j=1;j<=m;j++)
a[i+j]--;
}
f=1;
for(i=1;i<=n;i++)
if(a[i]) f=0;
if(f)
printf("yes\n");
else printf("no\n");
}
return 0;
}
hdu 2454 Degree Sequence of Graph G
最新推荐文章于 2021-05-05 18:54:14 发布