题目:
Description
Given a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:
Your task is to calculate d(A).
Input
The input consists of T(<=30) test cases. The number of test cases (T) is given in the first line of the input.
Each test case contains two lines. The first line is an integer n(2<=n<=50000). The second line contains n integers: a1, a2, ..., an. (|ai| <= 10000).There is an empty line after each case.
Each test case contains two lines. The first line is an integer n(2<=n<=50000). The second line contains n integers: a1, a2, ..., an. (|ai| <= 10000).There is an empty line after each case.
Output
Print exactly one line for each test case. The line should contain the integer d(A).
Sample Input
1 10 1 -1 2 2 3 -3 4 -4 5 -5
Sample Output
13
Hint
In the sample, we choose {2,2,3,-3,4} and {5}, then we can get the answer.
Huge input,scanf is recommended.
Huge input,scanf is recommended.
该题目很容易让人想到最大子段和,其实这只是一个变形,需要把结果存储起来。因为该题的数据量很大,时间复杂度
一定要控制在O(nlgn)以内。因为求最大子段和的时间复杂度只有O(n),如果将结果记录的话,那么解决这个问题的
时间复杂度就是O(2n)。
解决这个问题有两个关键:
1.从两边求取最大子段和
2.将结果存储
我们可以用两个数组left[M]和right[M]记录,left[i]表示a1……ai的最大子段和,right[i]表示ai……an的最大子段和。
然后求取MAX(left[i]+right[i+1])即可。
代码如下: