Cleaning（思维）

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf=1e18;
const int N=2e5+100;
ll pre[N],suf[N];
ll a[N];
int main(){
	int T;scanf("%d",&T);
	while(T--){
		pre[0]=0;
		bool f=false;
		int n;scanf("%d",&n);
		suf[n+1]=0;
		for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
		for(int i=1;i<=n;i++){
			if(a[i]>=pre[i-1]) pre[i]=a[i]-pre[i-1];
			else pre[i]=inf/2;
		}
		for(int i=n;i>=1;i--){
			if(a[i]>=suf[i+1]) suf[i]=a[i]-suf[i+1];
			else suf[i]=inf;
		}
		for(int i=1;i<n;i++){
			if(pre[i]==suf[i+1]){
				f=true;
				break;
			}
			else{
				ll t1=a[i],t2=a[i+1];
				if(t2>=pre[i-1]&&t1>=suf[i+2]){
					if(t2-pre[i-1]==t1-suf[i+2]){
						f=true;
						break;
					}
				}
			}
		}
		if(f) puts("YES");
		else puts("NO");
	}
	return 0;
}