求解最大子列和并返回首尾数字

求解最大子列和并返回首尾数字（Maximum Subsequence Sum）

浙大《数据结构（第二版）》PTA配套课后编程题寻找最大子列和并返回最大子列和的首尾数字，

题目内容：

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.

输入要求：
1.每个输入文件包含一个测试案例

2.每个测试案例包括两行

3.第一行为一个正整数K（K<=10000）

4.第二行为K个数字，由空格隔开

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.

输出要求：
1.对于每次测试，将结果全部输出在同一行，分别是：最大子列和、最大子列的首位数字、最大子列的末位数字。

2.输出数字之间必须只能用一个空格隔开，且最后一个数字之后不加空格。

3.如果最大子列和存在多个，取下标 i、j最小的一组子列（从左往右取第一组）。

4.如果输入的全部数字都是负数，则其最大子列和应返回0，并且应该输出整个子列的第一个和最后一个数字。

算法核心思想：

如果整数序列{a​​₁ ,a​​₂ ,a​​₃ ,…,a​​_k }的最大子列和为{a​​_i ,a​​_i+1 ,…,a​​_j },则
因此一旦发现当前子列和为负，则可以重新考虑一个新的子列。

实现程序：

#include <stdio.h>