求调一维dp

#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[201000][2],n,b[201000],ans,t,v[201000],near[200100],s[200100];
#define ccf(qwe,wer) (b[qwe]==b[wer]?b[qwe]:0)
signed main()
{
	scanf("%lld",&t);
	while(t--)
	{
		memset(a,0,sizeof(a));
		memset(v,0,sizeof(v));
		scanf("%lld",&n);
		for(int i=1;i<=n;++i)scanf("%lld",&b[i]);
		for(int i=1;i<=n;++i)s[i]=s[i-1]+ccf(i-1,i);
		for(int i=1;i<=n;++i)
		{
			near[i]=v[b[i]];
			v[b[i]]=i;
		}
		for(int i=1;i<=n;++i)
		{
			a[i][0]=max(a[i][0],a[i-1][0]+ccf(i-1,i));
			a[i][1]=max(a[i][1],a[i-1][1]+ccf(i-1,i));
			if(near[i])
			{
				a[i][0]=max(a[i][0],a[near[i]][0]+s[i-1]-s[near[i]]+b[i]);
				a[i][1]=max(a[i][1],a[near[i]][1]+s[i-1]-s[near[i]]+b[i]);
			}
		}
		printf("%lld\n",max(a[n][0],a[n][1]));
	}
	return 0;
}