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 -21Sample Output:
10 1 4给定一个字符串，要求你求出他的最大子串和，即在字符串的所有子串中，找出和最大的子串。
用一个int型的数组存储数据，首先输入为一个正整数N，表明字符串中一共有N个数字，设计利用一个int型的数组存储字符串。这道题算法利用在线处理，从前往后数。每读入一个数字就进行判断，如果当前的求和结果大于零，保留；如果大于零且大于之前计算的最大值，对最大值，左右边界的值进行替换；如果小于零说明当前串的值对后续串的值的影响为减小后续子串的值，舍去当前串，重新从零开始计算，将左边界置为舍去子串后一个数字。
