01-复杂度2 Maximum Subsequence Sum (25分)
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
作者
陈越
单位
浙江大学
代码长度限制
16 KB
时间限制
200 ms
内存限制
64 MB
题目大概意思就是求出最大子序列和,并输出该学历的第一个和最后一个元素,当这个数组都是负数的时候,直接输出0,第一个元素和最后一个元素。
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>a;
int thissum=0,maxsum=-1;
int left=0,templeft=0,right=n-1;
for(int i=0;i<n;i++){
cin>>a[i];
thissum+=a[i];
if(thissum<0){
thissum=0;
templeft=i+1;
}
else if(thissum>maxsum){
left=templeft;
right=i;
maxsum=thissum;
}
}
if(maxsum<0){
printf("0 %d %d",a[0],a[n-1]);
}
else {
printf("%d %d %d",maxsum,a[left],a[right]);
}
}