题目:
HOJ1205-吃糖果-习惯相邻的两个糖果不一样
代码:
#include<iostream>
using namespace std;
int Arr[1000200];
int main()
{
int t;
int n;
int val, biggest;
long long rest;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
biggest = 0;
rest = 0;
for(int i=0; i<n; i++)
{
scanf("%d",&val);
if(val > biggest)
{
biggest = val;
}
else
{
rest += val;
}
}
if(biggest - 1 <= rest)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
}
return 0;
}