Problem Link : http://lightoj.com:81/volume/problem/1217
#include <bits/stdc++.h>
#define pii pair <int,int>
#define pll pair <long long,long long>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define db double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define sqr(x) (x)*(x)
#define D(x) cout<<#x " = "<<(x)<<endl
#define VI vector <int>
#define DBG pf("Hi\n")
#define MOD 1000000007
#define CIN ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a) (int)a.size()
#define sf(a) scanf("%d",&a)
#define sfl(a) scanf("%lld",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sffl(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n) for(int i=0;i<n;i++)
#define loop1(i,n) for(int i=1;i<=n;i++)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=a;i>=b;i--)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d: ",z)
#define LINE_PRINT_CASE printf("Case %d:\n",z)
#define CASE_PRINT cout<<"Case "<<z<<": "
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define infinity (1<<28)
#define ull unsigned long long
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
using namespace std;
/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/
int n;
int ara[1001];
int dp[1001][1001][3];
bool xxxxx[1001][1001][3];
int yy=1;
int func(int idx, int last, int state)
{
if(idx>n)
{
if(state==0 && last!=n)
return ara[1];
return 0;
}
int &ret=dp[idx][last][state];
bool &cas=xxxxx[idx][last][state];
if(cas) return ret;
cas=1;
//// if(ret!=-1) return ret;
int p=0,q=0;
if(idx==1)
{
p=ara[1]+func(idx+2,idx,1);
q=func(idx+1,last,state);
}
else if(idx==2)
{
p=ara[2]+func(idx+2,idx,2);
q=func(idx+1,0,state);
}
else if(idx==n)
{
if(last!=n-1 && state!=1)
p=ara[n]+func(idx+2,idx,state);
q=func(idx+1,last,state);
}
else
{
p=ara[idx]+func(idx+2,idx,state);
q=func(idx+1,last,state);
}
return ret=max(p,q);
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;
sf(t);
TEST_CASE(t)
{
sf(n);
for(int i=1; i<=n; i++) sf(ara[i]);
// ms(dp,-1);
// yy++;
ms(xxxxx,0);
PRINT_CASE;
printf("%d\n",func(1,0,0));
}
return 0;
}