01-2. Maximum Subsequence Sum (25)
来源:互联网 发布:淘宝客浏览器插件 编辑:程序博客网 时间:2024/05/19 17:59
http://www.patest.cn/contests/mooc-ds/01-2
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 <stdio.h> #define MAXN 10001int last;long long maxSubseqSum(long long a[], int n){ long long thisSum = 0, maxSum = 0; for(int i = 0; i < n; ++i){ thisSum += a[i]; if(thisSum > maxSum){ maxSum = thisSum;last = i;} else if(thisSum < 0){ thisSum = 0;} } return maxSum; } int main(){ int k;long long a[MAXN], firstValue; scanf("%d", &k); for(int i = 0; i < k; ++i) scanf("%lld", &a[i]); long long maxSum = maxSubseqSum(a, k); if(maxSum == 0){int index = -1;for(int i = 0; i < k; ++i){if(a[i] == 0)index = i;}if(index != -1){firstValue = 0;last = index;}else{firstValue = a[0];last = k - 1;}}else{long long m = maxSum;int n = last;while(m > 0){firstValue = m;m -= a[n--];}}printf("%lld %lld %lld", maxSum, firstValue, a[last]); return 0; }
- 01-2. Maximum Subsequence Sum (25)
- 01-2. Maximum Subsequence Sum (25)
- 01-2. Maximum Subsequence Sum (25)
- PAT 01-2. Maximum Subsequence Sum (25)
- PAT 01-2. Maximum Subsequence Sum (25)
- 01-2. Maximum Subsequence Sum (25)
- 01-2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- 01-复杂度2. Maximum Subsequence Sum (25)
- Construct Binary Tree from Inorder and Postorder Traversal
- TCL招聘专职游戏体验师 用户体验成大屏游戏重点
- POJ 1840 Eqs
- Java Random 随机数
- C# 窗体(Form)中如何实现全局快捷键 如:[Ctrl + Enter]
- 01-2. Maximum Subsequence Sum (25)
- Cocos2d-x 3.2 大富翁游戏项目开发-第十七部分 Toast提示框
- [水题][第一阶段-回归水题][HDOJ-2030]汉字统计
- java中统计字符串中汉字,英文,数字,特殊符号个数
- BZOJ1003 [ZJOI2006]物流运输trans(集合型动态规划)
- 魔漫相机任晓倩:我是这样说服马云投资千万美金的
- POJ-1475(A*算法)
- 新的SQUASHFS 4.3中的unsquashfs4新特性,能显示镜像当初的生成参数了
- Export MODO file for MAYA