01-复杂度2 Maximum Subsequence Sum
分数 25
作者 陈越
单位 浙江大学
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
代码长度限制
16 KB
时间限制
200 ms
内存限制
64 MB
C++ (g++)
思路:
和最大子列和问题一样,先输入数据,然后计算sum值取最大,并把子列和这一序列的第一个数和最后一个数记录下来即可。
注意:有一个例子很坑!!!(对我来说)如果一个序列除了0都是负数,那肯定最大子列和为0,并且它自成一个序列,第一个数和最后一个数都是它。
代码样例:
#include<bits/stdc++.h>
using namespace std;
int main(){
int K;
cin>>K;
int flag=0;
int a[100005];
for(int i=0;i<K;i++){
cin>>a[i];
if(a[i]>0) flag=1;
}
int max=0;
int p1,p2;
int m=0;
for(int i=0;i<K;i++){
int sum=0;
for(int j=i;j<K;j++){
sum+=a[j];
if(sum>max) {
max=sum;
p1=a[i];
p2=a[j];
}
}
}
for(int i=0;i<K;i++){
if(a[i]==0&&!flag) m=1;
}
if(flag) cout<<max<<" "<<p1<<" "<<p2<<endl;
else if(m) cout<<0<<" "<<0<<" "<<0<<endl;
else cout<<0<<" "<<a[0]<<" "<<a[K-1]<<endl;
}