PAT 甲级 1007. Maximum Subsequence Sum (25)
来源:互联网 发布:seo工程师工资 编辑:程序博客网 时间:2024/06/16 16:27
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<string>#include<cstdio>#include<vector>using namespace std;int main() {int n;cin >> n;vector<int> v(n);int leftindex = 0, rightindex = n - 1, sum = -1, temp = 0, tempindex = 0;for (int i = 0; i < n; i++) {cin >> v[i];temp += v[i];if (temp < 0) {temp = 0;tempindex = i + 1;}else if(temp>sum){sum = temp;leftindex = tempindex;rightindex = i;}}if (sum < 0) sum = 0;cout << sum <<" "<< v[leftindex] <<" "<< v[rightindex] << endl;return 0;}
- PAT - 甲级 - 1007. Maximum Subsequence Sum (25)
- 【PAT甲级】1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25) PAT 甲级
- PAT甲级1007. Maximum Subsequence Sum (25)
- PAT甲级1007. Maximum Subsequence Sum (25)
- pat甲级1007. Maximum Subsequence Sum (25)
- PAT甲级 1007. Maximum Subsequence Sum (25)
- PAT 甲级 1007. Maximum Subsequence Sum (25)
- PAT 甲级 1007. Maximum Subsequence Sum
- PAT 甲级 1007. Maximum Subsequence Sum
- [PAT-甲级]1007.Maximum Subsequence Sum
- PAT甲级1007. Maximum Subsequence Sum
- PAT 甲级 1007. Maximum Subsequence Sum
- PAT甲级1007. Maximum Subsequence Sum (25) (vector)
- 【PAT甲级】【C++】1007. Maximum Subsequence Sum (25)
- PAT TEST甲级1007. Maximum Subsequence Sum (25)
- PAT甲级练习1007. Maximum Subsequence Sum (25)
- PAT甲级练习题A1007.Maximum Subsequence Sum (25)
- idea导入eclipse项目工程,步骤详解
- JSP自定义标签查询数据
- Linux环境mysql cpu过高问题排查
- 自媒体头条号重量级干货:24小时搞定头条新手期!
- Linux下php安装Redis扩展
- PAT 甲级 1007. Maximum Subsequence Sum (25)
- CSS3.0使用@font-face自定义字体
- springboot 配置文件明文加解密
- 单端输入和差分输入
- [Drools规则引擎]Drools6.5.0+eclipse4.6.2+Jdk1.7+Tomcat1.7环境部署
- java数据库编程--执行数据库更新操作
- webpack超详细配置, 使用教程(图文)
- ATS插件中常见的字符串操作1
- 约束查询删除与主键查询切换的SQL写法