Maximum Subsequence Sum
来源:互联网 发布:java ee 64位下载 编辑:程序博客网 时间:2024/05/21 22:52
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 -21
Sample Output:
#include<stdio.h>#define n 10000int I , J;int x = 0;int fun(int a[], int m){int thissum = 0, maxsum = -1;int i,II=0;I = a[0];J = a[0];for (i = 0; i < m; i++){thissum += a[i];if (a[i] >= 0) x = 1;if (thissum > maxsum){maxsum = thissum;J = a[i];I = a[II];}if (thissum < 0){thissum = 0;II = i + 1;}}return maxsum;}int main(){int K;int i, a[n];int answer;scanf("%d",&K);for (i = 0; i<K; i++)scanf("%d", &a[i]);answer = fun(a, K);if (x == 0){I = a[0];J = a[K - 1];answer = 0;}printf("%d %d %d\n", answer, I,J);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
- 编写代码模拟三次密码输入的场景。
- TP5 like模糊查询
- HDU 3072 Intelligence System 强连通缩点
- 代码整理
- css背景样式 列表样式 盒子模型 浮动
- Maximum Subsequence Sum
- 51nod-1380
- bzoj4916
- 【高精度】大整数类
- Kotlin从入门到放弃之基础篇(四)——属性、字段、接口
- ios 在FSCalendar基础上开发的签到功能 记录一下 不是太完善
- centos7下yum换阿里云源
- 二进制数中1的个数(拓展-比较二进制数AB不同)
- POJ3304 计算几何--判断直线与线段相交