Maximum Subsequence Sum
来源:互联网 发布:百度人口迁徙数据 编辑:程序博客网 时间:2024/06/05 21:16
01-复杂度2 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:
f10-10 1 2 3 4 -5 -23 3 7 -21
Sample Output:
10 1 4
#include <iostream>using namespace std;int main(){int K,flag=0;int A[100050];cin>>K;for(int i=0;i<K;i++)cin>>A[i];int Max_Sum=0,start=0,end=K-1;int Current_Sum=0,Current_Start,Current_End;for(int i=0;i<K;i++){if(A[i]==0) flag=1;Current_Sum=Current_Sum+A[i];if(Current_Sum>0){Current_End=i;if(Current_Sum>Max_Sum){Max_Sum=Current_Sum;start=Current_Start;end=Current_End;}}if(Current_Sum<0){Current_Sum=0;Current_Start=i+1;Current_End=i+1;}}if(Max_Sum>0)cout<<Max_Sum<<" "<<A[start]<<" "<<A[end];else if(Max_Sum==0&&flag==1)cout<<Max_Sum<<" "<<"0"<<" "<<"0";elsecout<<"0"<<" "<<A[0]<<" "<<A[K-1]; }
- 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
- 这里就一个破图
- caioj 1088 最短路模板
- 第四周项目1——建立单链表
- HNU OJ题库 1002C数字排序问题
- centos nmtui
- Maximum Subsequence Sum
- javaweb学习总结(五)——Servlet开发(一)
- C++项目总结二之内存溢出
- Python入门(实验)
- Object类
- java集合
- 对象,类,命名空间,继承......
- 原生JS实现Ajax的GET POST请求
- 操作系统之页面置换算法