1007. Maximum Subsequence Sum (25)
来源:互联网 发布:html怎么调用php文件 编辑:程序博客网 时间:2024/06/07 07:21
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 -21Sample Output:
10 1 4
#include <iostream>#include <vector>using namespace std;int main(){int n;cin>>n;vector<int> vec(n);for(int i=0;i<n;i++){cin>>vec[i];}int this_sum=0,max_sum=-1;int begin=0,end=n-1;int tmp_begin=0,tmp_end;for(int i=0;i<n;i++){this_sum+=vec[i];if(this_sum > max_sum){max_sum=this_sum;end=i;begin=tmp_begin;}if(this_sum < 0){this_sum=0;tmp_begin=i+1;}}if(max_sum == -1)max_sum=0;cout<<max_sum<<" "<<vec[begin]<<" "<<vec[end]<<endl;return 0;}
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- Aireplay-ng的6种攻击模式详解
- ZOJ1061
- Self Summary: Basic concepts of GPU
- xsl-fo图文混排的问题解决
- uva 11401 荣斥
- 1007. Maximum Subsequence Sum (25)
- Android笔记activity的生命周期
- hdoj 2050 折线分割平面
- HTML5 Canvas学习笔记之详解弧线的绘制
- 1.UI
- 新的旅程-为什么开始写博客
- 个人学习-java-this关键字使用
- 。。。杂谈。。。
- 2.UIView的认识