CF1899C.Yarik and Array

A subarray is a continuous part of array.

Yarik recently found an array $a$ of $n$ elements and became very interested in finding the maximum sum of a non empty subarray. However, Yarik doesn't like consecutive integers with the same parity, so the subarray he chooses must have alternating parities for adjacent elements.

For example, $[1, 2, 3]$ is acceptable, but $[1, 2, 4]$ is not, as $2$ and $4$ are both even and adjacent.

You need to help Yarik by finding the maximum sum of such a subarray.

子数组是数组的一个连续部分。

Yarik 最近发现了一个包含 $n$ 个元素的数组 $a$，并非常感兴趣于寻找一个非空子数组的最大和。然而，Yarik 不喜欢相邻的整数具有相同的奇偶性，因此他所选择的子数组必须满足：相邻元素的奇偶性交替出现。

例如，$[1, 2, 3]$ 是合法的，但 $[1, 2, 4]$ 不合法，因为 $2$ 和 $4$ 均为偶数且相邻。

你需要帮助 Yarik 找到满足上述条件的子数组的最大和。

The first line contains an integer $t$ $(1 \le t \le 10^4)$ — number of test cases. Each test case is described as follows.

The first line of each test case contains an integer $n$ $(1 \le n \le 2 \cdot 10^5)$ — length of the array.

The second line of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ $(-10^3 \le a_i \le 10^3)$ — elements of the array.

It is guaranteed that the sum of $n$ for all test cases does not exceed $2 \cdot 10^5$.

第一行包含一个整数 $t$（$1 \le t \le 10^4$），表示测试用例的数量。每个测试用例的描述如下：

每个测试用例的第一行包含一个整数 $n$（$1 \le n \le 2 \cdot 10^5$），表示数组的长度。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$-10^3 \le a_i \le 10^3$），表示数组的元素。

保证所有测试用例的 $n$ 之和不超过 $2 \cdot 10^5$。

For each test case, output a single integer — the answer to the problem.

对于每个测试用例，输出一个整数——即该问题的答案。