全TLE，求调

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
	ll t, n, s = 0, a[100001], mid = 0, lm = 0, mr = 0;
	cin >> t;
	for (ll j = 0; j < t; j++) {
		cin >> n;
		for (ll i = 0; i < n; i++) cin >> a[i];
		for (ll i = 0; i < n; i++) {
			mid = i;
			lm = 0;
			mr = 0;
			for (ll y = 0; y < n; y++) {
				if (y <= mid) {
					lm += a[y];
				} else {
					mr += a[y];
				}
			}
			if (lm == mr) {
				s++;
			}
		}
		if (s >= 1) {
			cout << "Yes" << endl;
			continue;
		} else cout << "No" << endl;
	}
	return 0;
}