7-2 a Fu the thief

7-2 Ah Fu, the thief

Ah Fu is an experienced thief . Take advantage of the dark moon and the high wind , Ah Fu is going to rob a shop on the street tonight .

There are a total of N Shops , There's some cash in every store .

Ah Fu investigated in advance and learned that , Only when he looted two adjacent shops at the same time , The alarm system on the street will start , Then the police will flock .

As a thief who has always committed crimes carefully , Ah Fu doesn't want to steal at the risk of being chased by the police .

He wants to know , Without alerting the police , The maximum amount of cash he can get tonight ？

Input format
The first line of input is an integer T, Means that there are T Group data .

The next set of data , The first line is an integer N , Means that there are N Shops .

The second line is N A positive integer separated by spaces , Indicates the amount of cash in each store .

The amount of cash in each store does not exceed 1000.

Output format
For each set of data , Output one line .

This line contains an integer , It means the amount of cash a Fu can get without alerting the police .

Data range
1≤T≤50,
1≤N≤105

sample input ：

2
3
1 8 2
4
10 7 6 14

sample output ：

8
24

Code ：

#include <iostream>
#include<string.h>
#include<math.h>
using namespace std;
int t,n,maxx;
int a[200];
int f[200][2];
int main()
{
    
    cin>>t;
    while(t--)
    {
    
        cin>>n;
        for(int i=1;i<=n;i++)
            cin>>a[i];
        for(int i=1;i<=n;i++)
        {
    
            f[i][0]=max(f[i-1][0],f[i-1][1]);
            f[i][1]=f[i-1][0]+a[i];
        }
        cout<<max(f[n][0],f[n][1])<<endl;
    }
    return 0;
}

202206260900 Japan