码迷,mamicode.com
首页 >  
搜索关键字:dp-on-线段树    ( 71个结果
hdu5141——LIS again
LIS again Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 132    Accepted Submission(s): 34 Problem Description A numeric sequence of a...
分类:其他好文   时间:2014-12-07 13:51:56    阅读次数:169
hdu3607——Traversal
Traversal Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1038    Accepted Submission(s): 365 Problem Description Xiao Ming is travelli...
分类:其他好文   时间:2014-12-07 13:50:41    阅读次数:134
hdu4719——Oh My Holy FFF
Oh My Holy FFF Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 626    Accepted Submission(s): 147 Problem Description N soldiers from t...
分类:其他好文   时间:2014-12-05 22:48:29    阅读次数:176
hdu2836——Traversal
Traversal Time Limit: 2000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 742    Accepted Submission(s): 275 Problem Description I arrive at a big lake...
分类:其他好文   时间:2014-12-05 17:31:55    阅读次数:229
hdu45221——小明系列问题——小明序列 线段树优化dp
小明系列问题——小明序列 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1918    Accepted Submission(s): 583 Problem Description   大家都知道小明最喜欢研究跟序列有...
分类:其他好文   时间:2014-12-04 21:40:06    阅读次数:272
hdu3016——Man Down
Man Down Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1740    Accepted Submission(s): 626 Problem Description The Game “Man Down 100...
分类:其他好文   时间:2014-12-02 22:35:33    阅读次数:219
hdu3698 Let the light guide us dp+线段树优化
http://acm.hdu.edu.cn/showproblem.php?pid=3698 Let the light guide us Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 62768/32768 K (Java/Others) Total Submission(s): 821    Accepted Su...
分类:其他好文   时间:2014-11-04 00:12:53    阅读次数:290
HDU 3698 DP+线段树
给出N*M矩阵,每个点建立灯塔有花费,每个点的灯塔有连接范围,求每一行都建立一个灯塔的最小花费,要求每相邻两行的灯塔可以互相连接,满足 |j-k|≤f(i,j)+f(i+1,k) DP思路,dp[i][j]=在第i行的j位置放置灯塔的最小花费,dp[i][j]=Min(dp[i-1][k]+a[i][j]),同时更新当前点可以覆盖该行的所有位置的最小值 要求上个区间的最小值,用线段树优化,否则...
分类:其他好文   时间:2014-10-14 16:17:28    阅读次数:267
题解 HDU 3698 Let the light guide us Dp + 线段树优化
http://acm.hdu.edu.cn/showproblem.php?pid=3698Let the light guide usTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 62768/32768 K (Java/Others) T...
分类:其他好文   时间:2014-08-21 22:25:44    阅读次数:391
HDU4719-Oh My Holy FFF(DP线段树优化)
Oh My Holy FFF Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 606    Accepted Submission(s): 141 Problem Description N soldiers fr...
分类:其他好文   时间:2014-08-19 22:33:35    阅读次数:346
71条   上一页 1 ... 5 6 7 8 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!