hdu 2425

Degree Sequence of Graph G

#include<bits/stdc++.h>
using namespace std;
int a[10001];
bool cmp(int x,int y){
	return x>y;
}
int main()
{
	int T,n,tot,ans;
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		tot=0;
		for(int i=1;i<=n;i++){
			scanf("%d",a+i)	;
			tot+=a[i];	
		}
		if(tot&1){
			printf("no\n");
			continue; 
		}
		for(int i=1;i<=n;i++){
			sort(a+i,a+n+1,cmp);
			int m=a[i];
			if(m<0||m>n-i)
			break;
			a[i]=0;
			for(int j=1;j<=m;j++)
			a[i+j]--;
		}
		 ans = 1;
        for(int i = 1; i <= n && ans; i++){
            if(a[i]) ans = 0;
        }
		printf("%s\n", ans?"yes":"no");
	}
	return 0;
	}