Codeforces Round #681 (Div. 2, based on VK Cup 2019-2020 - Final)——D. Extreme Subtraction

Codeforces Round #681 (Div. 2, based on VK Cup 2019-2020 - Final)——D. Extreme Subtraction

You are given an array a of n positive integers.

You can use the following operation as many times as you like: select any integer 1≤k≤n and do one of two things:

decrement by one k of the first elements of the array.
decrement by one k of the last elements of the array.
For example, if n=5 and a=[3,2,2,1,4], then you can apply one of the following operations to it (not all possible options are listed below):

decrement from the first two elements of the array. After this operation a=[2,1,2,1,4];
decrement from the last three elements of the array. After this operation a=[3,2,1,0,3];
decrement from the first five elements of the array. After this operation a=[2,1,1,0,3];
Determine if it is possible to make all the elements of the array equal to zero by applying a certain number of operations.

Input
The first line contains one positive integer t (1≤t≤30000) — the number of test cases. Then t test cases follow.

Each test case begins with a line containing one integer n (1≤n≤30000) — the number of elements in the array.

The second line of each test case contains n integers a1…an (1≤ai≤106).

The sum of n over all test cases does not exceed 30000.

Output
For each test case, output on a separate line:

YES, if it is possible to make all elements of the array equal to zero by applying a certain number of operations.
NO, otherwise.
The letters in the words YES and NO can be outputed in any case.

Example
inputCopy
4
3
1 2 1
5
11 7 9 6 8
5
1 3 1 3 1
4
5 2 1 10
outputCopy
YES
YES
NO
YES

题意： 给你一个数组，你可以从左边开始选一段数减一，也可以从右边开始选一段数减一，问是否有方法使你可以把数组处理成全0的情况。

思路： 我们发现，我们只要从一边处理，把他处理成一个不上升序列就行了。你在处理一边的时候相当于一直在从另一边进行操作。我们从第一个数开始处理，记录一个数组中现存的最小数，我们每遇到一个数就判断它是否足够大到可以承载前面的操作，如果不可以，就说明已经错误了。如果可以，再拿它减去前面处理之后的真正的数的大小和最小值进行比较，如果更小，就赋值，如果不小，就把操作数加上他们的差值，因为我们要的是不上升的序列，我们需要把它至少处理成跟前面的最小相同。如果操作能完整遍历一遍，说明可以成功。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[1000007];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n;
		scanf("%d",&n);
		int cha=0;
		int minn=0x3f3f3f3f;
		int flag=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			
			a[i]-=cha;
			if(a[i]<0)flag=1;
			if(a[i]<minn)minn=a[i];
			else
			{
				cha+=a[i]-minn;
			}
		}
		if(flag==1)
		{
			printf("NO\n");
		}else{
			printf("YES\n");
		}
	}
	return 0;
 }