pat甲级1007. Maximum Subsequence Sum (25)
来源:互联网 发布:网络拓扑描述 编辑:程序博客网 时间:2024/05/29 02:16
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
题意分析:给一连串的数组,求最大子序列和,对于每一组测试数据,输出最大子序列数和,以及最大子序列的第一个数和最后一个序号的数。
由于k<=10000,数相对较小,所以套用两层for循环即可,注意当最大子序列之数和小于0,sum=0,这时输出第一个数与最后一个数
AC参考代码:
#include<iostream>#include<algorithm>#include<cstring>#include<string.h>#include<cstdio>#include<stdio.h>using namespace std;int a[10001];int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); int sum=-1; int start,endd; int temp; for(int i=0;i<n;i++) { int temp=0; for(int j=i;j<n;j++) { temp+=a[j]; if(temp>sum) { sum=temp; start=a[i]; endd=a[j]; } } } if(sum<0) { printf("0 %d %d\n",a[0],a[n-1]); return 0; } printf("%d %d %d\n",sum,start,endd); return 0;}
- PAT - 甲级 - 1007. Maximum Subsequence Sum (25)
- 【PAT甲级】1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25) PAT 甲级
- PAT甲级1007. Maximum Subsequence Sum (25)
- PAT甲级1007. Maximum Subsequence Sum (25)
- pat甲级1007. Maximum Subsequence Sum (25)
- PAT甲级 1007. Maximum Subsequence Sum (25)
- PAT 甲级 1007. Maximum Subsequence Sum (25)
- PAT 甲级 1007. Maximum Subsequence Sum
- PAT 甲级 1007. Maximum Subsequence Sum
- [PAT-甲级]1007.Maximum Subsequence Sum
- PAT甲级1007. Maximum Subsequence Sum
- PAT 甲级 1007. Maximum Subsequence Sum
- PAT甲级1007. Maximum Subsequence Sum (25) (vector)
- 【PAT甲级】【C++】1007. Maximum Subsequence Sum (25)
- PAT TEST甲级1007. Maximum Subsequence Sum (25)
- PAT甲级练习1007. Maximum Subsequence Sum (25)
- PAT甲级练习题A1007.Maximum Subsequence Sum (25)
- Linux初级学习第九单元
- 【CF446D】DZY Loves Games(games)
- 问题解决:Ubuntu和Windows系统的时间不同步
- 代码整洁之道精华——第十四章 逐步改进
- 系统集成项目管理工程师教程看书笔记16
- pat甲级1007. Maximum Subsequence Sum (25)
- (转)Android 自己实现 NavigationView [Design Support Library(1)]
- VTK基本概念之坐标系统
- poj 1611 并查集模板
- 关于远程连接桌面问题
- Linux操作系统基础
- 伪类和伪元素
- 获取MAC地址
- java 使用RabbitMQ示例