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.
翻译:
对于每个测试用例,在一行中输出最大和,以及最大子序列的第一个和最后一个数字。 数字必须用一个空格分隔,但行尾不能有多余的空格。 如果最大子序列不是唯一的,则输出具有最小索引 i 和 j 的子序列(如示例案例所示)。 如果所有K个数都是负数,那么它的最大和被定义为0,并且你应该输出整个序列的第一个和最后一个数字。
1.如果全都是负数,则输出【0 第一个数 最后一个数】
2.如果原序列中除了0就是负数,如:‘0 -3 -6