havel-hakimi定理的直接运用,套用模板即可;
题目链接:Degree Sequence of Graph G
AC代码:
#include <iostream>
#include <functional>
#include <string.h>
#include <algorithm>
using namespace std;
int arr[1002];
bool love_zy(int n)
{
int i,j;
for(i=0;i<n-1;i++)
{
sort(arr+i,arr+n,greater<int>());
if(arr[i]+i>=n)return false;
for(j=i+1;j<=arr[i]+i;j++)
{
arr[j]--;
if(arr[j] < 0) return false;
}
}
if(arr[n-1]!=0)return false;
return true;
}
int main()
{
int T;
int n;
cin>>T;
while(T--)
{
memset(arr,0,sizeof(arr));
cin>>n;
for(int i=0;i<n;i++)
cin>>arr[i];
if(love_zy(n))
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
}
return 0;
}