1007. Maximum Subsequence Sum (25) 求最大连续子序列和
来源:互联网 发布:win10怎么安装c语言 编辑:程序博客网 时间:2024/06/06 08:55
这道题比较简单,但是要注意细节,比如max的初始化值,比如对于输入是负数和零的情况。
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
#include <cstdio>#include <iostream>#include <vector>using namespace std;int main(){ int K, left = 0, right = 0, sum_tmp=0, max =0,left_tmp=0, flag = 1; cin >> K; int tmp; vector<int> input; for (int i = 0; i < K; i++) { cin >> tmp; input.push_back(tmp); if (input[i] >= 0) flag = 0; sum_tmp += input[i]; //cout << "sum_tmp " << sum_tmp << endl; if (sum_tmp > max) { max = sum_tmp; left = left_tmp; right = i; }else if (sum_tmp < 0) { sum_tmp = 0; left_tmp = i + 1; } } if (max == 0) { if (flag) cout << 0 << " " << input[0] << " " << input[K - 1]; else cout << "0 0 0"; } //if (flag) // cout << 0 << " " << input[0] << " " << input[K - 1]; else cout << max << " " << input[left] << " " << input[right]; system("pause"); return 0;}
- 1007. Maximum Subsequence Sum (25) 求最大连续子序列和
- [PAT甲级]1007. Maximum Subsequence Sum(求连续最大子序列和)
- PAT 1007. Maximum Subsequence Sum (25) 最大子序列和
- 【PAT】1007 Maximum Subsequence Sum (25) 最大连续子序列和 +记录位置
- 关于最大连续子序列和的问题 (Maximum Subsequence Sum Problem)
- PAT-1007. Maximum Subsequence Sum(最大连续子数列)
- 1007. Maximum Subsequence Sum (25) -------最大子列和
- Maximum Subsequence Sum最大连续数列和
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 最大连续子数组,一次遍历,stack辅助
- pat(A) 1007. Maximum Subsequence Sum(和最大子段)
- Maximum Sum 最大子矩阵和+dp+(最大连续子序列的变形)
- Maximum Subsequence Sum Problem最大顺序子序列求和
- 动态规划之递增子序列最大和(Maximum Sum Increasing Subsequence)
- Max Sum 最大连续子序列和
- 求连续子序列最大和
- 求数组最大连续子序列和
- 求连续子序列的最大和
- 求最大连续子序列和
- 省市县三级联动
- 记录php踩过的坑
- java项目res内存不断增大
- 转载关于Linux的命令
- WebView使用,附送Html5Activity一份
- 1007. Maximum Subsequence Sum (25) 求最大连续子序列和
- spring之BeanFactory
- PCL+MFC
- PHP array_multisort—对多个数组或多维数组进行排序
- mysql执行顺序
- java中的排序
- 电脑加固态与加内存
- 斐波那契数列
- 匿名内部类访问外部类方法中的局部变量