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 -21
Sample Output:
10 1 4
#include<iostream>
using namespace std;
void Max4(int list[],int N)
{
int i,j=0,min,max,pos,flag=0,sum=0;
min=list[0];
max=list[N-1];
int thissum=0,maxsum=0;
for(i=0;i<N;i++)
{
if(list[i]>=0)
{
flag=1;
}
thissum+=list[i];
if(thissum>maxsum)
{
max=list[i];
maxsum=thissum;
pos=i;
}
else if(thissum<0)
{
thissum=0;
}
}
if(flag==1&&maxsum>0)//0和负数
{
for(i=pos;i>=0;i--)
{
sum+=list[i];
if(sum==maxsum&&list[i-1]!=0)
{
min=list[i];
}
}
}
else if(flag==0)
{
maxsum=0;
min=list[0];
max=list[N-1];
}
else if(maxsum<=0&&flag==1)
{
maxsum=0;
min=0;max=0;
}
cout<<maxsum<<" "<<min<<" "<<max;
}
int main()
{
int list[100000]={0},N,re;
cin>>N;
for(int i=0;i<N;i++)
{
cin>>list[i];
}
Max4(list,N);
return 0;
}
注意点主要在
1.最大和有一段为0时需要把0放到子列中。
2.最大子列的右边界易求,但左边界不好直接确定,故对maxsum进行比较求和,反推出左边界。
3.题目中要求均为负数情况,输出子列和0和开头结尾两元素,要特殊考虑。