平衡序列

A46106.[GESP202409 三级] 平衡序列

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int main(){
    int t;
    cin >> t;

    for(int z=1;z<=t;z++){
        int n,a[N]={},sum=0;
        cin >> n;

        for(int i=1;i<=n;i++){
            cin >> a[i];
            if(a[i]==0){
                sum++;
            }
        }
        if(sum==n){                                  //注意！特判n<2！和全为0
            cout << "No" << endl;
            break;
        }if(n<2){
            break;
        }
        
        int s1=0,s2=0,f=0;
        for(int i=1;i<=n;i++){
            s1=0,s2=0,f=0;
            for(int j=1;j<=i;j++){
                s1+=a[j];
            }for(int j=i+1;j<=n;j++){
                s2+=a[j];
            }
            if(s1==s2){
                cout << "Yes" << endl;//判断Yes
                f=1;
                break;
            }
        }
        if(f==0){
            cout << "No" << endl;//判断No
        }
    }
    //cout << "Yes" << endl << "No" << endl << "Yes" << endl << "No" << endl << "No"; 
    return 0;
}