Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } 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
结尾无空行
题目意思如下:
先输入一个整数N,在输入N个数字,找出它的最大子列和,并输出这个子列和的第一个数字和最后一个数字。如果最大子列和是负数,那么最大子列和就是0,输出这个序列的第一个数字和最后一个数字。
代码如下,关键的地方是如何记录最大子列和的第一个数字和最后一个数字,其次是判断是否都为负数。
def MaxSubseqSum(A,N):
MaxSum = ThisSum = 0
a = b = c = -1
for i in range(N):
ThisSum += A[i]
if ThisSum > MaxSum:
MaxSum = ThisSum
b = i
if c > a:
a = c+1
elif ThisSum < 0:
ThisSum = 0
c = i
if MaxSum == 0:
s = 0
for i in range(N):
if A[i] == 0:
s = 1
break
if s == 0:
RList = [0,A[0],A[-1]]
else:
RList = [0,0,0]
else:
RList = [MaxSum,A[a],A[b]]
return RList
N = int(input())
A = list(map(int,input().split()))
RList = MaxSubseqSum(A,N)
print(RList[0],RList[1],RList[2])