Some error occured while loading page for you. Please try again.
Given an array of elements, find the maximum possible sum among
We define a subarray as a contiguous subsequence. Note that empty subarrays/subsequences should not be considered.
The first line of input contains a single integer denoting the number of test cases.
The first line of each test case contains a single integer . The second line contains space-separated integers denoting the elements of .
The subarray and subsequences you consider should have at least one element.
Print two space-separated integers denoting the maximum sums of nonempty subarrays and nonempty subsequences, respectively.
Sample Input 0
1 2 3 4
2 -1 2 3 4 -5
Sample Output 0
In the first case: The maximum sum for both types of subsequences is just the sum of all the elements since they are all positive.
In the second case: The subarray is the subarray with the maximum sum, and is the subsequence with the maximum sum.