题目:
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
要点:最大连续序列,并记录开始以及结束数字。
注意点:1.当有相同大小连续序列时,记录较前面的;
2.有0其他都为负时,输出0 0 0;
3.测试点竟然没有考虑类似1 -1 0 2这种情况,按照题目要求应该输出 2 1 2,然而我的程序一开始输出2 2 2在系统里竟然全通过。
#include<iostream>
#include<string>
using namespace std;
int up=0,down=0,summax=0;
void max(int n[],int k)
{
int sum,i,up0;
summax=n[0];
sum=n[0];
for (i=1;i<k;i++)
{
if(sum<0)
{
sum=n[i];
up0=i;
}else
{
sum=sum+n[i];
}
if(summax<sum)
{
summax=sum;
up=up0;
down=i;
}
}
}
int main()
{
int k,i,j;
cin>>k;
int n[k];
bool mark=false;
for(i=0;i<k;i++)
{
cin>>n[i];
if(n[i]>=0)
{
mark=true;
}
}
if(mark==false)
{
cout<<0<<' '<<n[0]<<' '<<n[k-1];
}else
{
max(n,k);
cout<<summax<<' '<<n[up]<<' '<<n[down];
}
return 0;
}