Maximum Subsequence Sum
来源:互联网 发布:程序员面试金典 pdf 编辑:程序博客网 时间:2024/06/06 10:06
复杂度2 Maximum Subsequence Sum (25分)
Given a sequence of KK integers { N_1N
1
, N_2N
2
, …, N_KN
K
}. A continuous subsequence is defined to be { N_iN
i
, N_{i+1}N
i+1
, …, N_jN
j
} where 1 \le i \le j \le K1≤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 KK (\le 10000≤10000). The second line contains KK 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 ii and jj (as shown by the sample case). If all the KK 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 -21
Sample Output:
10 1 4
#include <iostream>#include <vector>using namespace std;int arr[10010];vector<pair<int,int>> vec;int maxSubSeqSum(int arr[], int n){ int thisSum = 0,maxSum = 0; int left = 0; for (int i = 0; i < n; i++){ thisSum += arr[i]; if(thisSum < 0){ thisSum = 0; left = i+1; } else if(thisSum > maxSum) { maxSum = thisSum; vec.push_back(make_pair(arr[left], arr[i])); } else if(thisSum == maxSum){ if(vec.size()==0) { vec.push_back(make_pair(arr[left],arr[i])); } } } return maxSum;}int main(){ int n; cin>>n; bool flag = false; for(int i = 0; i <n; i++){ cin>>arr[i]; if(arr[i] >= 0){ flag = true; } } int res = maxSubSeqSum(arr,n); if(flag){ cout<<res<<" "; } else { cout<<"0"<<" "<<arr[0]<<" "<<arr[n-1]; return 0; } cout<<vec[vec.size()-1].first<<" "<<vec[vec.size()-1].second;}
- 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
- Java设计模式——工厂模式(简单工厂、工厂方法 、抽象工厂 )
- 如何自定义可变参数函数
- Kubernetes 1.6新特性系列|在Kubernetes里配置私有DNS区域和上游服务器
- Git 在 Android Studio 中的使用(图解)
- Windows下编译FFmpeg
- Maximum Subsequence Sum
- Android与服务器的通信
- C——结构体中的函数指针
- 机器学习入门好文
- java处理页面乱码
- maven安装与配置
- Sublime text3安装及Nodejs开发环境的配置
- POJ 2828 Buy Tickets (线段树 单点更新-查找第k大元素)
- Android奇巧:ListView实现Item局部刷新