PAT A1007
来源:互联网 发布:费曼技巧 知乎 编辑:程序博客网 时间:2024/04/28 09:22
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 -21
Sample Output:10 1 4
#include <cstdio>using namespace std;const int maxn = 10010;const int INF = -0xffffff;int num[maxn];int main(){ int N; scanf("%d", &N); for(int i = 0; i < N; i++){ scanf("%d", &num[i]); } int sum = INF, x = 0, y = 0; for(int i = 0; i < N; i++){ int _max = 0; for(int j = i; j < N; j++){ _max += num[j]; if(_max > sum){ sum = _max; x = num[i]; y = num[j]; } } } if(sum < 0) printf("0 %d %d\n", num[0], num[N-1]); else printf("%d %d %d", sum, x, y); return 0;}
- PAT A1007
- pat a1007
- PAT A1007. Maximum Subsequence Sum
- PAT A1007 Maximum Subsequence Sum(25)
- PAT甲级练习题A1007.Maximum Subsequence Sum (25)
- a1007 . Maximum Subsequence Sum (25)
- 刷清橙OJ--A1007.特殊的数字3
- 清澄A1007. 特殊的数字3
- Tsinsen 清橙 A1007. 特殊的数字3 (回文数)
- pat
- 【PAT】
- PAT
- PAT
- PAT
- PAT
- PAT
- PAT
- PAT
- mybatis的动态SQL与模糊查询
- 关于FTPClient(Apache的commons.net包下的)研究
- eclipse 突然一直 报 An internal error occurred during: "Building workspace".
- Fedora 25 Workstation 安装指南
- 欢迎使用CSDN-markdown编辑器
- PAT A1007
- 移动互联网时代的营销
- SUMO应用工具:MAROUTER
- 拖拽事件
- 欢迎使用CSDN-markdown编辑器
- Ubuntu14.04虚拟机下安装USB转串口驱动(PL2303/)
- 在POM配置Maven plugin提示错误“Plugin execution not covered by lifecycle configuration”的解决方案
- Android service 不被杀死“永不退出的服务”(双进程,服务,多进程,微信)
- linux 防火墙配iptables 置及其使用