想写一个20pts的暴力解但是0pts（

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

const int N = 2e5+10;
bool vis[N];
int a[N];
int n;
int ans = -0x3f3f3f3f;
int calc[N];
int rnum, rid;
int bnum, bid;

void dfs(int dep, int rnum, int bnum, int rid, int bid){
	if(dep == n){
		int sum = 0;
		for(int i = 1; i <= n; i++)
			sum += calc[i];
		ans = max(ans, sum);
		return ;
	}
		
	vis[dep+1] = 1;
	if(dep > 1){
		if(a[dep+1] == rnum && dep+1 != rid){
			calc[dep+1] = rnum;
		}
	}
	dfs(dep+1, a[dep+1], bnum, dep+1, bid);
	calc[dep+1] = 0;
	
	if(vis[1] == 1){
		vis[dep+1] = 0;
		if(dep > 1){
			if(a[dep+1] == bnum && dep+1 != bid){
				calc[dep+1] = bnum;
			}
		}
		dfs(dep+1, rnum, a[dep+1], rid, dep+1);
		calc[dep+1] = 0;
	}
}

signed main(){
	//freopen("1.in", "r", stdin);
	//freopen("1.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin >> T;
	while(T--){
		memset(calc, 0, sizeof calc);
		memset(a, 0, sizeof a);
		memset(vis, 0, sizeof vis);
		cin >> n;
		for(int i = 1; i <= n; i++)
			cin >> a[i];
		dfs(0, 0, 0, 0, 0);
		cout << ans << '\n';
		ans = 0;
	}
	return 0;
}
/*

*/