ZJU PAT 1007. Maximum Subsequence Sum-CSDN博客

Given a sequence of K integers { N₁, N₂, ..., N_K }. A continuous subsequence is defined to be { N_i, N_i+1, ..., N_j } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

Input Specification:

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.

Output Specification:

For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

Sample Input:

10
-10 1 2 3 4 -5 -23 3 7 -21

Sample Output:

10 1 4

经典问题，求最大子序列和的变种，需要记录最大子序列的头和尾。同时如果序列为全负，则和为0，头和尾分别为整个序列的第一和最后一个数字。O(n)算法，同时特别处理一下全负情况即可

 1 lenth = input()
 2 list = raw_input().split()
 3 start = temp = sum = 0
 4 max = -1
 5 end = lenth - 1
 6 for i in range(lenth):
 7     sum += int(list[i])
 8     if sum < 0:
 9         sum = 0
10         temp = i + 1
11     elif sum > max:
12         max = sum
13         start = temp
14         end = i
15 if max < 0:
16     max = 0
17 print max, list[start], list[end]