Maximum Subsequence Sum
来源:互联网 发布:java抛出运行时异常 编辑:程序博客网 时间:2024/05/29 16:24
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
#include <iostream>using namespace std;int main(){int n;cin >> n;int* data = new int[n];for(int i = 0;i < n;++ i)cin >> data[i];bool all_negative(true);for(int i = 0;i < n;++ i)if(data[i] >= 0)all_negative = false;if(true == all_negative){cout << "0" << " " << data[0] << " " << data[n - 1];return 0;}int max(-1),sum,p1,p2;for(int i = 0;i < n;++ i){sum = 0;for(int j = i;j < n; ++ j){sum += data[j];if(sum > max){p1 = i;p2 = j;max = sum;}}}cout << max << " " << data[p1] << " " << data[p2];return 0;}
- Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- PAT1007. Maximum Subsequence Sum
- PAT_1007: Maximum Subsequence Sum
- 1007 Maximum Subsequence Sum
- PAT - Maximum Subsequence Sum
- PAT1007. Maximum Subsequence Sum
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum
- 1007.Maximum Subsequence Sum
- Maximum Subsequence Sum
- pat1007 Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- Maximum Subsequence Sum
- XEN 4.1.0 PVOPS设置和启动中遇到的一些问题
- 分享三千万优惠 民心看房报名仅剩2天
- 游戏程序的设计模式--工厂模式
- 批量操作时使用动态数组:ArrayList
- 四月首周楼市成交量大跌 月底或迎首次规模降价
- Maximum Subsequence Sum
- INDEX FULL SCAN 与 INDEX FAST FULL SCAN
- 我的时间管理之一 ——做好规划
- 使用优化器性能视图获取SQL语句执行环境
- Palindromic Number
- Oracle SQL tuning 步骤
- PAT Ranking
- C++ Lists
- 找工作的点滴