PAT1007. Maximum Subsequence Sum (25)
来源:互联网 发布:淘宝工商银行不能付款 编辑:程序博客网 时间:2024/06/05 05:38
1007. Maximum Subsequence Sum (25)
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
basic题目,不过有坑点,全为负数时输出0,存在一个数据为0其他数据为负数情况
#include<iostream>#include<algorithm>#include<string>using namespace std;int a[10001];int main(){ ios::sync_with_stdio(false); int n; while(cin>>n) { for(int i=0;i<n;++i) cin>>a[i]; int sum, st=a[0], en=a[n-1]; int maxsum=-1; for(int i=0;i<n;++i) { sum = 0; for(int j=i;j<n;++j) { sum += a[j]; if(maxsum < sum) { maxsum = sum; st = a[i]; en = a[j]; } } } if(maxsum < 0) cout<<"0 "<<st<<" "<<en<<endl; else cout<<maxsum<<" "<<st<<" "<<en<<endl; } return 0;}
- PAT1007. Maximum Subsequence Sum (25)
- PAT1007 Maximum Subsequence Sum (25)
- PAT1007. Maximum Subsequence Sum (25)
- PAT1007. Maximum Subsequence Sum (25)
- PAT1007. Maximum Subsequence Sum
- PAT1007. Maximum Subsequence Sum
- pat1007 Maximum Subsequence Sum
- 【DP-最大子串和】PAT1007. Maximum Subsequence Sum
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum[PAT1007][PTA01-复杂度2]——动态规划
- PAT1007:Maximun Subsequence Sum Java语言实现
- 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)
- iptables学习
- ODEX文件相关
- Linux tcpdump命令详解
- 我们一起学 ABAP (01) ~ 初识SAP ABAP
- Pdf解决方案
- PAT1007. Maximum Subsequence Sum (25)
- HMM经典介绍论文【Rabiner 1989】翻译(十)——连续观测密度
- winform 鼠标指针移过组件选中行勾选移开未选中去除勾选
- idea 配置 springMvc dome
- CRT的使用,发布项目
- 启视差效果(相对父元素移动)
- Java 中Class文件详解
- 小程序之显示 隐藏功能(二)
- zoj 3502 Contest (状态压缩dp)