PAT - 测试 01-复杂度2 Maximum Subsequence Sum (25分)

$N2N_2N?2??, ..., NKN_KN?K?? }. A continuous subsequence is defined to be { NiN_iN?i??, Ni+1N_{i+1}N?i+1??, ..., NjN_jN?j?? } where 1≤i≤j≤K1 \le i \le j \le K1≤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 $(≤10000\le 10000≤10000). The second line contains KKK 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

Sample Input:

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

Sample Output:

10 1 4

译文：
给出一个数列,数列中有K个整数，当1<=i<=j<=K时，存在连续整数的数和。整个数列的最大连续数列和来自长度最长，数最大的数列。举个例子，{-2，11，-4，13，-5，-2}，这个数列中，最大的连续数列为{11，-4,13}，
最大数列和为20.
现在你需要找出最大的连续数列和及连续数列的第一个数和最后一个数。
输入：
输入一个测试数据行。第一行是输入的数据个数（KKK<）,第二行输入KKK个数，以空格为分割。
输出：
对于每一个测试的情况下，在一个行中的最大总和的输出，与第一和最大序列的最后数字。数字必须用一个空格分开，但最后一个数后没有空格。
在该最大序列不是唯一的情况下，输出一个具有最小索引的数。如果输入的所有的数都是负数，则它的最大总和被定义为0，你应该输出的第一和整个序列的最后一个数。
============================
第一次code:

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 
 4 void MaxSubseSum(int n);
 5 int main(void) 
 6 {
 7     int n;
 8     scanf("%d",&n);
 9     MaxSubseSum(n);
10     return 0;
11 }
12 void MaxSubseSum(int n)
13 {
14     int i,ThisSum=0,MaxSum=0,start=0,end=0,start1=0,flag=0;
15     int a[n]; 
16     for(i=0;i<n;i++)
17     {
18        scanf("%d",&a[i]);
19     }
20     for(i=0;i<n;i++)
21     {
22         ThisSum += a[i];
23         if(a[i]>=0)
24         flag = 1;
25         if(ThisSum > MaxSum)
26         {
27             start = start1;    
28             MaxSum = ThisSum;
29             end = i;
30         }
31         else if (ThisSum < 0)
32         {
33             ThisSum = 0;
34             start1=i+1;
35         }
36     }
37     if(MaxSum == 0)
38     {
39         if(flag == 0)
40         {
41             printf("0 %d %d",a[0],a[n-1]);
42         }
43        else
44         {
45             printf("0 0 0");  
46         }
47     }
48     else
49     {
50         printf("%d %d %d",MaxSum,a[start],a[end]);
51     }
52 }

技术分享