首页 > 代码库 > HDU--Max sum---DP练习
HDU--Max sum---DP练习
Max Sum
Time Limit: 2000ms Memory limit: 32768K 有疑问?点这里^_^
题目描述
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.
输入
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).
输出
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.
示例输入
2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5
示例输出
Case 1: 14 1 4 Case 2: 7 1 6
提示
hdoj1003 注意:本题后台测试数据量比较大,请使用C语言scanf输入。避免超时!!!!
又是一道很经典的dp,题意是让求最大连续字段和 不难写出状态转移方程 dp[i]=max(dp[i-1]+i,i);
<script src="https://code.csdn.net/snippets/418792.js" type="text/javascript"></script>
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。