HDU 1003 Max Sum(最大子列和)
来源:互联网 发布:淘宝嘉年华报名要求 编辑:程序博客网 时间:2024/05/15 12:54
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003
Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
Sample Input
25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5
Sample Output
Case 1:14 1 4Case 2:7 1 6
代码如下:
#include <cstdio>#define INF 0x3f3f3f3fint main(){ int t; int n, tt; scanf("%d",&t); int k = 0; while(t--) { scanf("%d",&n); int sum = 0, maxx = -INF; int start = 1, endd = 1, pos = 1; for(int i = 1; i <= n; i++) { scanf("%d",&tt); sum+=tt; if(sum > maxx) { start = pos; endd = i; maxx = sum; } if(sum < 0) { sum = 0; pos = i+1; } } printf("Case %d:\n",++k); printf("%d %d %d\n",maxx,start,endd); if(t) printf("\n"); } return 0;}
2 0
- HDU 1003 Max Sum(最大子列和)
- HDU 1003 Max Sum(最大连续子列和)
- HDU 1003 Max Sum(最大连续子序列和)
- hdu 1003 Max Sum (求最大子序列和)
- HDU 1003----Max Sum(最大连续子序列和)
- HDU 1003 Max Sum(最大连续子段和)
- 【HDU】 1003 Max Sum(最大连续子序列和)
- [动态规划]hdu 1003 Max Sum 最大子列
- hdu 1024 Max Sum Plus Plus(m段最大子列和)
- Max Sum hdu+最大子序列和
- hdu 1003 Max Sum 最大连续子串和
- HDU-1003 Max Sum(最大连续子段和)
- hdu 1003 MAX SUM(最大连续子序列和)
- HDU 1003 Max Sum 最大连续子序列的和
- HDU 1003 Max Sum(dp,最大连续子序列和)
- HDU 1003 MAX SUM 最大连续子段和DP
- HDU 1003 Max Sum(dp,最大连续子序列和)
- HDU 1003 Max Sum 最大子段和dp解题
- 函数的使用——根据传入的值,打印出相应的矩形。
- 关于Token的简要理解
- poj 3070 矩阵快速幂简单题
- Python装饰器学习(九步入门)
- 在ubuntu中配置中文版man手册
- HDU 1003 Max Sum(最大子列和)
- install oracle java in ubuntu 12.04
- 百度地图初步Hello BaiduMap——(参考Baidu官网)
- IAR中代码在flash和ram中调试流程
- RHCE6 Preperation (2) - yum source and auto mount
- ios单例
- ZOJ-#3465 The Hive(字符串模拟)
- strcpy源码分析
- 暑期开发过程中的一些经验记录