Maximum Subsequence Sum (25)
来源:互联网 发布:2017编程笔记本 编辑:程序博客网 时间:2024/06/02 06:49
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;vector<int>seq;int main(){ int n,tmp,maxsum=0,thisum=0,start=0,end,tmpi=0,tmpj=0; cin>>n; end=n-1; for(int i=0;i<n;i++) { cin>>tmp; seq.push_back(tmp); if(thisum>=0) { thisum+=seq[i]; tmpj=i; } else { thisum=seq[i]; tmpi=tmpj=i; } if(thisum>maxsum||thisum==0&&end==n-1) { maxsum=thisum; start=tmpi; end=tmpj; } } cout<<maxsum<<" "<<seq[start]<<" "<<seq[end]<<endl; return 0;}
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- PAT1007. 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)
- PAT Maximum Subsequence Sum (25)
- Parcel数据传输过程,简要分析Binder流程
- Shape图形图片
- MapReduce:详解Shuffle过程
- 机器学习-决策树学习笔记
- VTK+VC6.0配置
- Maximum Subsequence Sum (25)
- Python 获取命令行输出
- MVC 保存二进制到数据库,并显示文件的方法(图片显示或下载文件)
- 按位与、或、异或等运算方法(转载)
- 639UVa棋盘放车
- Unity3D协程介绍 以及 使用
- spring3集成velocity配置
- Redis 与网络流量整形
- Android 仿淘宝选中商品不同尺寸的按钮组(二)