Given a sequence of K integers { N~1~, N~2~, ..., 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.
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
这题12分 这个其实就最大子列和问题的扩展 以前写的裸最大子列和问题
,但还是没ac
错误代码
#include<bits/stdc++.h>
using namespace std;
int s[10005];
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
int sum=0;
int maxn=0;
for(int i=0;i<n;i++){
cin>>s[i];
}
int b;
int a[10000]={0};
int flag=0;
for(int i=0;i<n;i++){
sum+=s[i];
if(sum<0){
sum=0;
}
else if(sum>maxn){
a[flag++]=s[i];
maxn=sum;
}
}
if(maxn<0) maxn=0;
cout<<maxn<<" "<<a[0]<<" "<<a[flag-1]<<endl;
return 0;
}
其实这个,把maxn设置成为-1,那么就会15分了 我是用数组求的,所以对于下标的控制就是对数组值的控制,
AC、代码、
#include<bits/stdc++.h>
using namespace std;
int s[10005];
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
int l=0;
int r=n-1;
int m=0;
int maxn=-1;
int sum=0;
for(int i=0;i<n;i++){
cin>>s[i];
sum+=s[i];
if(sum<0){
sum=0;
m=i+1;
}
else if(sum>maxn){
maxn=sum;
r=i;
l=m;
}
}
if(maxn<0) maxn=0;
cout<<maxn<<" "<<s[l]<<" "<<s[r]<<endl;
return 0;
}