两行

#include<iostream>
using namespace std;long long T;long long q[100005];int n;int a[100005];int main(){stdcin>>T;while(T--){long long T;long long q[100005];int n;int a[100005];stdcin>>n;for(int i=1;i<=n;i++)stdcin>>a[i],q[i]=q[i-1]+a[i];bool f=false;for(int i=1;i<=n;i++){int t=q[i],y=q[n]-q[i];if(t==y){f=true;break;}}stdcout<<(f==true?"Yes":"No")<<'\n';for(int i=1;i<=n;i++)q[i]=0,a[i]=0;}return 0;}