hdoj 1003 最大子序列 (考虑负数)On算法

1003题目

Problem Description（问题描述）

Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.

  给你一个数组各个元素为a[1],a[2],a[3]......a[n],你的工作是找到其子序列和的最大值，例如一个数组(6,-1,5,4,-7)，那么在这个数组中他的最大和就是6 + (-1) + 5 + 4 = 14
Input（输入）

Input（输入）

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

 输入的第一行包含一个T(1<=T<=20)，这个T代表的是有多少行测试数据。接下来就有T行数据跟着，每一行开始的第一个数N(1<=N<=100000)代表着后面有N个数字跟着，（这些数字在-1000到1000之间）

Output（输出）

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of th