1007. Maximum Subsequence Sum (25)
来源:互联网 发布:机械演示制作软件 编辑:程序博客网 时间:2024/06/01 15:55
题目:
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. TheMaximum 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
题解:
最大连续子序列和问题。需要用leftidx和rightidx来保存下标值。
代码:
#include <cstdio>int main(){int n;scanf("%d", &n);int *a = new int[n + 10];int leftidx = 0, rightidx = n - 1, sum = -1, tmp = 0, tmpidx = 0;for(int i = 0; i < n; i++){scanf("%d", &a[i]);tmp += a[i];if(tmp > sum){sum = tmp;leftidx = tmpidx;rightidx = i;}else if(tmp < 0){tmp = 0;tmpidx = i + 1;}} if(sum < 0)sum = 0;printf("%d %d %d", sum, a[leftidx], a[rightidx]);return 0;}
- 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)
- 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)
- 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)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- ajax 获取数据太慢,想写个加载中
- 自律,阿米尔汗、村上春树、乔布斯最重视的品格
- 关于图片上传限制的js
- 设计模式----单例模式(singleton)
- Linux UDP网络编程程序设计-LS12
- 1007. Maximum Subsequence Sum (25)
- Android---第一篇博客
- 如何用C++实现自己的Tensorflow
- MYSQL解析XML数据
- 泛型
- Android Studio代码混淆
- php 排序
- 朴素贝叶斯算法
- 11.10笔记整理、作业和学习心得