题目描述:
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
我的思路:
利用动态规划。 d p [ i ] = m a x ( d p [ i − 1 ] + v s [ i ] , v s [ i ] ) , d p [ i ] dp[i]=max(dp[i-1]+vs[i],vs[i]),dp[i] dp[i]=max(dp[i−1]+vs[i],vs[i]),dp[i]表示以 v s [ i ] vs[i] vs[i]作为结尾的连续序列的最大和 。
用maxn记录对大的序列和,从头遍历dp[i]数组,找到第一个等于maxn的dp[i],且最右的元素vs[right]等于vs[i],随后从位置right向左开始遍历,知道所求的和等于maxn,边找到了vs[left]的下标left。
注意负数的处理,若maxn小于0,便可以代表所有的值都小于0
我的代码:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int maxn;
int main(){
int n,cnt=0;
cin>>n;
int vs[n],dp[n];
for(int i=0;i<n;i++){
cin>>vs[i];
if(i==0){
dp[i]=vs[i];
maxn=dp[i];
}else{
dp[i]=max(vs[i],dp[i-1]+vs[i]);
maxn=max(dp[i],maxn);
}
}
int right=0,left=0,sum=0;
for(int i=0;i<n;i++){
if(dp[i]==maxn){
right=i;
break;
}
}
for(int i=right;i>=0;i--){
sum+=vs[i];
if(sum==maxn){
left=i;
break;
}
}
if(maxn<0){
cout<<"0 "<<vs[0]<<" "<<vs[n-1];
}else{
cout<<maxn<<" "<<vs[left]<<" "<<vs[right];
}
return 0;
}