全TLE求调！

#include <bits/stdc++.h>
using namespace std;

bool hs(int n, int a[]) {
	for (int i = 1; i < n; i++) {
		int he1 = 0, he2 = 0;
		for (int j = 0; j < i; j++) {
			he1 += a[j];
		}
		for (int j = i; j < n; j++) {
			he2 += a[j];
		}
		if (he2 == he1) {
			return 1;
		}
	}
	return 0;

}
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int c;
		cin >> c;
		int a[c];
		for (int j = 0; j < c; j++)
			cin >> a[j];
		if (hs(c, a))
			cout << "Yes"<<endl;
		else
			cout << "No"<<endl;
	}
	return 0;
}