POJ 2479 动态规划 最大子段和

POJ 2479 最大子段和 动态规划解法

题目链接点这里
Maximum sum
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 42766 Accepted: 13308
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.
Output

Print exactly one line for each test case. The line should contain the integer d(A).
Sample Inpu