Codeforces Round #636 (Div. 3) C.Alternating Subsequence

Codeforces Round #636 (Div. 3) C.Alternating Subsequence

题目链接
Recall that the sequence b is a a subsequence of the sequence a if b can be derived from a by removing zero or more elements without changing the order of the remaining elements. For example, if a=[1,2,1,3,1,2,1], then possible subsequences are: [1,1,1,1], [3] and [1,2,1,3,1,2,1], but not [3,2,3] and [1,1,1,1,2].

You are given a sequence a consisting of n positive and negative elements (there is no zeros in the sequence).

Your task is to choose maximum by size (length) alternating subsequence of the given sequence (i.e. the sign of each next element is the opposite from the sign of the current element, like positive-negative-positive and so on or negative-positive-negative and so on). Among all such subsequences, you have to choose one which has the maximum sum of elements.

In other words, if the maximum length of alternating subsequence is k then your task is to find the maximum sum of elements of some alternating subsequence of length k.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1≤t≤1e4) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1≤n≤2⋅1e5) — the number of elements in a. The second line of the test case contains n integers a1,a2,…,an (−109≤ai≤109,ai≠0), where ai is the i-th element of a.

It is guaranteed that the sum of n over all test cases does not exceed 2⋅1e5 (∑n≤2⋅1e5).

Output

For each test case, print the answer — the maximum sum of the maximum by size (length) alternating subsequence of a.

Example

input

4
5
1 2 3 -1 -2
4
-1 -2 -1 -3
10
-2 8 3 8 -4 -15 5 -2 -3 1
6
1 -1000000000 1 -1000000000 1 -1000000000

output

2
-1
6
-2999999997

因为题目要求必须是数组尽可能长的，那我们就可以用一个数组存这些数，一个从头到尾存，一个从尾到头存，最后累加答案即可，AC代码如下：

#include
using namespace std;
typedef long long ll;
 
int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        ll a[n];
        for(int i=0;i<n;i++) cin>>a[i];
        vector<ll>q1,q2;
        q1.push_back(a[0]);
        q2.push_back(a[n-1]);
        for(int i=1;i<n;i++){
            ll num=q1.back();
            if(num*a[i]<0) q1.push_back(a[i]);
            else if(a[i]>num){
                while(!q1.empty() && a[i]*q1.back()>0){
                    q1.pop_back();
                }
                q1.push_back(a[i]);
            }
        }
        for(int i=n-2;i>=0;i--){
            ll num=q2.back();
            if(num*a[i]<0) q2.push_back(a[i]);
            else if(a[i]>num){
                while(!q2.empty() && a[i]*q2.back()>0){
                    q2.pop_back();
                }
                q2.push_back(a[i]);
            }
        }
        ll sum1=0,sum2=0,ans=-1e18;
        for(int i=0;i<q1.size();i++){
           sum1+=q1[i];
        }
        ans=max(ans,sum1);
        for(int i=0;i<q2.size();i++){
           sum2+=q2[i];
        }
        ans=max(ans,sum2);
        cout<<ans<<endl;
    }
    return 0;
}