1007. Maximum Subsequence Sum (25)
2016-08-31 15:16
302 查看
1007. Maximum Subsequence Sum (25)
时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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:
10 1 4
#include <stdio.h> #include <stdlib.h> int main() { int k ; int maxi,maxj; int nowi,nowj,i,num; int sum,maxsum,flag=0; scanf("%d",&k); maxsum = -1; sum = 0; for(i=0;i<k;i++) { scanf("%d",&num); if(!num) { flag = 1; } if(sum == 0 ) { nowi = num; } sum += num; nowj = num; if(sum < 0) { sum = 0; } if(sum > maxsum) { maxsum = sum; maxi = nowi; maxj = nowj; } } if(maxsum == 0) { maxj = nowj; } if(flag && maxsum==0) { maxi = 0; maxj = 0; } printf("%d %d %d",maxsum,maxi,maxj); //system("pause"); return 0; }
相关文章推荐
- 25 内容提供者的创建使用
- 1048. Find Coins (25)-PAT甲级真题(Hash散列)
- PAT (Advanced) 1020. Tree Traversals (25)
- PAT 1071. Speech Patterns (25)
- 1086. Tree Traversals Again (25)-PAT甲级真题
- 1025. 反转链表 (25)--PAT乙级
- PAT 1010. Radix (25)
- 1114. Family Property (25)-PAT甲级真题(并查集)
- jq代码学习25——基于jQuery的ajax聊天室 fl ch6 p209
- PAT 1086. Tree Traversals Again (25)
- 1097. Deduplication on a Linked List (25)
- PAT 甲级 1043. Is It a Binary Search Tree (25)
- 25_C# 实现VMS客户端——控件_总结
- 25.EASYUI Dialog组件
- PAT 甲级 1060. Are They Equal (25)
- day25,page50,total100
- 1060. Are They Equal (25)-PAT甲级真题(科学计数法)
- PAT 甲级 1075. PAT Judge (25)
- android开发步步为营之25:开发自定义进度条对话框
- 25、html5 Web Workers