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.
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
code
#include<stdio.h>
int main()
{
int K,Num,CF,F,L,a,b,CurrentSeq = 0,SumSeq = 0; //定义K个整数,每次接受整数的存储器Num,当前首位值CF,首位值F,末位值L,当前子列和SumSeq,最大子列和SumSeq
scanf("%d",&K);
scanf("%d",&CF);
CurrentSeq = CF;
a=CF; // 全是负数首位
F=CF;
L=CF;
SumSeq = CurrentSeq;
for (int i=1;i<K;i++)
{
scanf("%d",&Num);
b=Num;
if (CurrentSeq < 0)
{
CurrentSeq = 0;
CF = Num;
} //先处理进入是负数的情况
CurrentSeq+=Num;
if (CurrentSeq>SumSeq)
{
F = CF;
L = Num;
SumSeq = CurrentSeq;
}
}
if(SumSeq<0)
{
//printf("%d %d %d",max,max,max); //处理全是负数的情况
printf("0 %d %d",a,b);
}
else
{
printf("%d %d %d",SumSeq,F,L);
}
return 0;
}
//首先接受输入
//其次对于每个输入进行计算
//最后输出最大子列和 以及最大子列最前最后数
意外
在测试样例中,全是负数一直无法通过。
后来发现是因为输出带有逗号。
错误代码:
printf("0,%d,%d",a,b);