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≤10^4) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1≤n≤2⋅10^5) — the number of elements in a. The second line of the test case contains n integers a1,a2,…,an (−10^9 ≤ ai ≤ 10^9,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⋅105 (∑n≤2⋅105).

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

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

别的方法暂不论，这题模拟就可以写了
对区间段的模拟，和P1981 表达式求值这个题类似
放一块儿比较，希望能对这种方法更加通透
本题考虑找出区间段的最大值即可
AC代码如下（代码是借鉴li_wen_zhuo的）：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <iomanip>
#define LL long long
using namespace std;
const int N = 2e5 + 5;
LL a[N];
bool check(int x, int y)
{
	if ((x > 0 && y > 0) || (x < 0 && y < 0)) return true;
	else return false;
}
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		for (int i = 0; i < n; i++)
			cin >> a[i];

		int i = 0, j = 0;
		LL sum = 0,num=0;     
		while (i < n)//处理数组
		{
			j = i; //i~j是正负相同的一个区间段
			num = a[j]; 
			while (j + 1 < n&&check(a[j], a[j + 1]))
			{
				num = max(num, a[j + 1]); //记录区间段的最大值
				j++;
			}
			i = j + 1;
			sum += num;
		}
		cout << sum << endl;
	}
	return 0;
}