蒟蒻太菜了不会推，糊了一个$2^n$暴力上去还有错。。。

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

int T, n, a[100100], color[100100], c[100100];
long long ans;

inline void dfs(int step) {
	if (step == n + 1) {
		memset(c, 0, sizeof(c));
		for (int i = 1; i <= n; i++) {
			bool flag = 0;
			for (int j = 1; j < i; j++) {
				if (color[i] == color[j])
					flag = 1;
			}
			if (!flag)
				c[i] = 0;
			else {
				int t = 0;
				for (int j = 1; j < i; j++) {
					if (color[i] == color[j])
						t = a[j];
				}
				if (a[i] == t)
					c[i] = a[i];
				else
					c[i] = 0;
			}
		}
		long long sum = 0;
		for (int i = 1; i <= n; i++)
			sum += c[i], printf("%d ", c[i]);
		printf("\n");
		ans = max(sum, ans);
		return ;
	}
	color[step] = 0;
	dfs(step + 1);
	color[step] = 1;
	dfs(step + 1);
}

int main() {
//	freopen("color.in", "r", stdin);
//	freopen("color.out", "w", stdout);
	scanf("%d", &T);
	while (T--) {
		ans = 0;
		scanf("%d", &n);
		memset(a, 0, sizeof(a));
		memset(color, 0, sizeof(color));
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		dfs(1);
		printf("%lld\n", ans);
	}
//	fclose(stdin);
//	fclose(stdout);
	return 0;
}