1007. Maximum Subsequence Sum (25)
2015-10-03 17:24
369 查看
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:
Sample Output:
[/code]
..., 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
#include <iostream> #include <vector> #include <stack> #include <queue> #include <deque> #include <cstring> #include <string> #include <vector> #include <map> #include <algorithm> #include <functional> #include <fstream> using namespace std; int K; vector<int> v; int main() { //fstream cin("F://max.txt"); int max = -1,spos = 0,epos = 0; int tmpmax = 0,tmpspos = 0,tmpepos = 0; cin >> K; for(int i = 0;i < K;i++) { int t; cin >> t; v.push_back(t); tmpmax += t; if(tmpmax < 0) { tmpmax = 0; tmpspos = i + 1; tmpepos = i + 1; } else { tmpepos = i; if(tmpmax > max) { max = tmpmax; spos = tmpspos; epos = tmpepos; } } } if(K == 0) cout << "0 0 0"; else { if(max < 0) cout << 0 << " " << v[0] << " " << v[v.size() - 1]; else cout << max << " " << v[spos] << " " << v[epos]; } system("pause"); return 0; }
[/code]
相关文章推荐
- HDU5493 Queue【线段树】
- [UI]抽屉菜单DrawerLayout分析(三)
- 建造者模式与原型模式/builder模式与prototype模式/创建型模式
- Arduino1:中断知识点汇总
- [UI]抽屉菜单DrawerLayout分析(二)
- [UI]抽屉菜单DrawerLayout分析(一)
- ZOJ-3892- Available Computation Sequence
- iOS_UIAlertController
- pat1017Queueing at Bank (25)
- iOS之UI随笔-字典转模型以及双模型的构建
- [Leetcode] - 96 Unique Binary Search Trees
- IOS初学笔记UI--UIView
- JPA主键生成策略
- HDU 1815, POJ 2749 Building roads(2-sat)
- UIScrollView与NSTimer计时器、分页指示器控件的使用
- UICollectionView的使用
- hdu5493 Queue 线段树
- note: please rebuild precompiled header ..... /UIKit-2DYE2I2D1B3GL.pcm 解决方案
- 69. Sqrt(x) (Divide-and-Conquer)
- java gui案例开发