1941B - Rudolf and 121

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n,a[200005];
int main(){
	cin>>t;
	for(int i=1;i<=t;i++){
		memset(a,0,sizeof(a));
		cin>>n;
		for(int j=1;j<=n;j++) cin>>a[j];
		for(int j=2;j<n;j++){
			if(a[j]>=2&&a[j-1]>0&&a[j+1]>0){
				int k=min(a[j]/2,min(a[j-1],a[j+1]));
				a[j]-=(2*k);
				a[j-1]-=k;
				a[j+1]-=k;
			}
		}
		bool flag=1;
		for(int j=1;j<=n;j++){
			if(a[j]>0){
				cout<<"NO"<<endl;
				flag=0;
				break;
			}
		}
		if(flag==1) cout<<"YES"<<endl;
	}
	return 0;
}