RT 目标40，实际0 题

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n;
int a[N];
int sub[N];
int maxn=-0x7fffffff;
int c[N];
void put(){
	cout<<1;
	bool blue=0,red=0;
	int num=0;
	int bluex=0,redx=0;
	if(sub[1]==1){
		blue++;
		bluex=1;
	}else{
		red++;
		redx=1;
	}
	for(int i=2;i<=n;i++){
		if(sub[i]==1){
			if(blue>0){
				if(a[bluex]==a[i]){
					c[i]=a[i];
				}
			}
			bluex=i;
			blue++;
		}else{
			if(red>0){
				if(a[redx]==a[i]){
					c[i]=a[i];
				}
			}
			redx=i;
			red++;
		}
	}
	for(int i=1;i<=n;i++){
		num+=c[i];
	}
//	cout<<"*"<<num<<"*"<<'\n';
	maxn=max(maxn,num);
}
void dfs(int x){
	if(x==n+1){
		put();
		return;
	}
	sub[x]=1;
	dfs(x+1);
	sub[x]=2;
	dfs(x+1);
}
int main(){
	int T;
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=1;i<=n;i++) cin>>a[i];
		memset(sub,0,sizeof(sub));
		memset(c,0,sizeof(sub));
		maxn=-0x7fffffff;
		dfs(1);
		cout<<maxn<<'\n';
	}    
    return 0;
}