tempCodeRunnerFile.cpp

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for (int i = a; i < b; i++)

void solve() {

}

int main() {
    fastio;

    int t;
    cin >> t;
    while (t--) {
         int n;
        cin>>n;
        vector<pair<int  , char>> arr(n);
        for(int i=0;i<n;i++){
            cin>>arr[i].first;
            if(arr[i].first%2!=0) arr[i].second = 'O';
            else arr[i].second = 'E';
            // cout<<arr[i].second<<endl;
        }
        int l = 0 , r = 0;
        int sum = arr[0].first ;
        int  ori = arr[0].first;
        // cout<<ori<<endl;
        // cout<<"run ";
        while(l<n){
            ori = max(ori , sum);
            if(r+1<n && arr[r].second != arr[r+1].second){
                r++;
                sum+=arr[r].first;
                // cout<<"run 1 ";
            }
            else if(r<n && l<r){
                // cout<<"run 3 ";
                int temp = sum;
                for(int i = r;i>=l;i--){
                    int temp2 = temp;
                    //cout<<"running till  "<<i<<" ";
                    for(int x = l;x<=i;x++){
                        //cout<<"from  "<<x<<" ";
                        temp2-=arr[x].first;
                        ori = max(ori , temp2);
                    }
                    temp-=arr[i].first;
                    //cout<<endl;
                }
                r++;
                l = r;
                //cout<<l<<endl;
                ori = max(arr[l].first , ori);
            }
            else if(l==r && r+1<n){
                r++;
                l = r;
                sum = arr[l].first;
                //cout<<"run 3 ";

            }
            else break;
            ori = max(ori , sum);
            // cout<<"original "<<ori<<endl;
        }
        cout<<ori<<endl;
    }

    return 0;
}