Max Sum hdu 1003 dp 入门
来源:互联网 发布:网络管理工具 编辑:程序博客网 时间:2024/06/15 04:36
Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 242968 Accepted Submission(s): 57369
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
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1176 1087 1069 1058 1159
代码也不加了 直接看大神的就可以
0 0
- Max Sum hdu 1003 dp 入门
- HDU--1003 -- Max Sum [dp]
- HDU 1003 Max Sum(dp)
- HDU 1003 Max Sum(dp)
- hdu 1003 Max Sum dp
- hdu 1003 Max Sum (DP)
- HDU 1003 Max Sum(DP)
- HDU-1003-Max Sum【DP】
- HDU 1003 Max Sum DP .
- HDU-1003-Max Sum(DP)
- HDU-1003 Max Sum (dp)
- HDU 1003 Max Sum (经典dp入门题)
- HDU- Max Sum (dp)
- hdu 1003 Max Sum (DP)
- HDU ACM 1003 Max Sum(简单DP)
- hdu-1003(java)-Max Sum (DP)
- hdu 1003 Max Sum(简单DP)
- hdu 1003 MAX sum (简单DP)
- Java空指针异常
- recyclerview点击事件以及toolbar使用
- IOS正则判断手机号码,电话号码函数--(可用)
- async的用法
- JAVA IO流简单读写文件
- Max Sum hdu 1003 dp 入门
- bash shell脚本执行的几种方法
- [leetcode]: 168. Excel Sheet Column Title
- Linux安装Nginx
- iOS 拨打电话三种方式总结
- Maven详解之仓库------本地仓库、远程仓库
- IOS开发之格式化日期时间--(可用)
- 1.Java内存区域与内存溢出异常
- bootstrap按钮组