#include <iostream>
using namespace std;
int main()
{
int t; cin>>t;
for(int i=0; i<t; i++){
long long n; cin>>n;
long long a[n],r;
for(int i=0; i<n; i++) cin>>a[i];
for(int i=1; i<n-1; i++){
if(a[i-1]>a[i]){
r=a[i];
a[i]+=(a[i-1]-r);
a[i+1]+=(a[i-1]-r);
}
}
for(int i=n-2; i>0; i--){
if(a[i]>a[i+1]){
r=a[i];
a[i]-=(r-a[i+1]);
a[i-1]-=(r-a[i+1]);
}
}
if(a[0]>a[1]) cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
return 0;
}
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |