1007. Maximum Subsequence Sum
来源:互联网 发布:python 金融 pdf 编辑:程序博客网 时间:2024/05/15 15:02
1007. 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:10-10 1 2 3 4 -5 -23 3 7 -21Sample Output:
10 1 4
#include<cstdio>#include<cstring>using namespace std;int a[100001];int main(){int n,i,j,sum,now;scanf("%d",&n);sum=now=0;sum--;int x;int l,r;bool f=true;for (i=0;i<n;i++)scanf("%d",&a[i]);for (i=0;i<n;i++){x=a[i];if (x>=0) f=false;if (now<0) {now=0;j=i;}now+=x;if (now>sum) {sum=now;l=j;r=i;}}if (f)printf("0 %d %d\n",a[0],a[n-1]);elseprintf("%d %d %d\n",sum,a[l],a[r]);}
- 1007. Maximum Subsequence Sum
- 1007.Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- (PAT)1007. Maximum Subsequence Sum
- (PAT)1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- pat 1007. Maximum Subsequence Sum
- Uva4730 Kingdom (并查集+线段树)
- 学习面向对象第三节
- XAMPP/MYSQL 忘记root密码
- 再识智能指针
- Linux编程学习之文件IO篇-lseek函数
- 1007. Maximum Subsequence Sum
- Java的循环部分
- 获取计算机网络相关信息
- windows下mysql配置文件my.ini的位置
- 视频播放--MovieTexture和VideoPlayer
- HK Missing Numbers
- 使用Python抓取我爱我家二手房数据
- PAT (Advanced Level) Practise 1053 Path of Equal Weight (30)
- C