Given a sequence of K integers { N1, N2, …, 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.
译文: 每个输入文件包含一个测试用例。每个案例占用两行。第一行包含一个正整数K(≤10000)。第二行包含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.
译文: 对于每个测试用例,在一行中输出最大的和,以及最大子序列的第一个和最后一个数字。数字之间必须用一个空格隔开,但行尾不能有多余的空格。如果最大子序列不是唯一的,则输出索引i和j最小的子序列(如示例所示)。如果所有的K个数都是负的,那么它的最大和被定义为0,你应该输出整个序列的第一个和最后一个数。
Sample Input:
10
-10 1 2 3 4 -5 -23 3 7 -21
Sample Output:
10 1 4
代码:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,x;
vector<int>v;//储存数字
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
v.push_back(x);
}
int max=-1,star=0,end=n-1;//最大和、开始、结尾
for(int i=0;i<n;i++)
{
int sum=0;//每次归0
for(int j=i;j<n;j++)
{
sum+=v[j];
if(sum>max)
{
max=sum;
star=i;
end=j;
}
}
}
if(max==-1)//当全为负数是
cout<<0<<" "<<v[0]<<" "<<v[n-1];
else
cout<<max<<" "<<v[star]<<" "<<v[end];
return 0;
}