ACM入門--喫糖果

題目：

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;
}