codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1343C.md (2695B)


      1 Source: https://codeforces.com/problemset/problem/1343/C
      2 
      3 C. Alternating Subsequence
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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]$.
     22 
     23 You are given a sequence $a$ consisting of $n$ positive and negative elements (there is no zeros in the sequence).
     24 
     25 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.
     26 
     27 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$.
     28 
     29 You have to answer $t$ independent test cases.
     30 
     31 Input
     32 
     33 The first line of the input contains one integer $t$ ($1 \le t \le 10^4$) — the number of test cases. Then $t$ test cases follow.
     34 
     35 The first line of the test case contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the number of elements in $a$. The second line of the test case contains $n$ integers $a_1, a_2, \dots, a_n$ ($-10^9 \le a_i \le 10^9, a_i \ne 0$), where $a_i$ is the $i$-th element of $a$.
     36 
     37 It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$ ($\sum n \le 2 \cdot 10^5$).
     38 
     39 Output
     40 
     41 For each test case, print the answer — the maximum sum of the maximum by size (length) alternating subsequence of $a$.
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 4
     49 5
     50 1 2 3 -1 -2
     51 4
     52 -1 -2 -1 -3
     53 10
     54 -2 8 3 8 -4 -15 5 -2 -3 1
     55 6
     56 1 -1000000000 1 -1000000000 1 -1000000000
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 2
     63 -1
     64 6
     65 -2999999997
     66 ```
     67 
     68 Note
     69 
     70 In the first test case of the example, one of the possible answers is $[1, 2, \underline{3}, \underline{-1}, -2]$.
     71 
     72 In the second test case of the example, one of the possible answers is $[-1, -2, \underline{-1}, -3]$.
     73 
     74 In the third test case of the example, one of the possible answers is $[\underline{-2}, 8, 3, \underline{8}, \underline{-4}, -15, \underline{5}, \underline{-2}, -3, \underline{1}]$.
     75 
     76 In the fourth test case of the example, one of the possible answers is $[\underline{1}, \underline{-1000000000}, \underline{1}, \underline{-1000000000}, \underline{1}, \underline{-1000000000}]$.