PAT甲级 1007. Maximum Subsequence Sum (25)
来源:互联网 发布:网络电阻 编辑:程序博客网 时间:2024/06/14 13:25
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
区间最大和,动态规划
#include<iostream>#include<cstdio>#include<string.h>#include<math.h>#include<algorithm>using namespace std;int k[10050];int main(){int n;while(~scanf("%d",&n)){for(int i=0;i<n;i++){scanf("%d",&k[i]);}int sum=0,st=0;int maxEnd=0,maxSum=-1,maxStart=0;for(int i=0;i<n;i++){sum+=k[i];if(sum>maxSum){maxSum=sum;maxEnd=i;maxStart=st;}if(sum<0){st=i+1;sum=0;}}if(maxSum==-1) {maxSum=0;maxStart=0;maxEnd=n-1;}if(n!=0)printf("%d %d %d\n",maxSum,k[maxStart],k[maxEnd]);}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)
- elasticsearch 东八区问题
- Android Xml文件操作
- java字符串除法
- How to port new audio codec into Android
- [C++ 从入门到放弃-06]C++STL之multimap多重映照容器
- PAT甲级 1007. Maximum Subsequence Sum (25)
- 关于Toast的一些常见操作
- 正则表达式基础
- 获取任意小数点位的百分比表示
- oracle的nvl和nvl2函数
- 16s rDNA数据分析经验总结
- POJ 1005 & ZOJ 1049 & UVA 2363
- 取Oracle_表名_字段名_注释等实用语句
- Eclipse自动提示相关