动态规划
iteye_4729
这个作者很懒,什么都没留下…
展开
-
hdu 2084 数塔(最基础最简单的DP)
数塔 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7404 Accepted Submission(s): 4412 Problem Description 在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的...2011-08-27 21:26:14 · 113 阅读 · 0 评论 -
hdu 2571 命运
命运 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2499 Accepted Submission(s): 893 Problem Description 穿过幽谷意味着离大魔王lemon已经无限接近了!可谁能想到,yife...2011-08-27 21:34:30 · 79 阅读 · 0 评论 -
hdu 2577 How to Type(很爽很好玩的DP)
How to Type Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 842 Accepted Submission(s): 364 Problem Description Pirates have finished deve...2011-08-27 21:46:01 · 148 阅读 · 0 评论 -
hdu 2227 Find the nondecreasing subsequences(DP+树状数组+离散化)
Find the nondecreasing subsequences Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 503 Accepted Submission(s): 192 Problem Description H...2011-11-13 00:17:07 · 165 阅读 · 0 评论 -
hdu 1506 Largest Rectangle in a Histogram(DP)
Largest Rectangle in a Histogram Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3722 Accepted Submission(s): 1104 Problem Description A ...2011-11-13 00:35:02 · 162 阅读 · 0 评论