随笔分类 -  ACM-DP

上一页 1 2
HDOJ-2602 Bone Collector [DP-01背包问题]
摘要：Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12502Accepted Submission(s): 4874Pro... 阅读全文
posted @ 2012-07-18 12:13 max_xbw 阅读(319) 评论(0) 推荐(0)
HDOJ-1864 最大报销额[DP-01背包问题]
摘要：转自：http://blog.csdn.net/kay_sprint/article/details/7237608#cpp最大报销额Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Tota... 阅读全文
posted @ 2012-07-18 10:52 max_xbw 阅读(266) 评论(0) 推荐(0)
【转】01背包问题动态规划详解
摘要：转载自 sunstar1989最终编辑 中华复生母动态规划是用空间换时间的一种方法的抽象。其关键是发现子问题和记录其结果。然后利用这些结果减轻运算量。比如01背包问题。因为背包最大容量M未知。所以，我们的程序要从1到M一个一个的试。比如，开始任选N件物品的一个。看对应M的背包，能不能放进去，如果能放... 阅读全文
posted @ 2012-07-17 21:02 max_xbw 阅读(330) 评论(0) 推荐(0)
HDOJ-1176 免费馅饼[DP入门]
摘要：免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13555Accepted Submission(s): 4485Problem Descr... 阅读全文
posted @ 2012-07-17 10:38 max_xbw 阅读(203) 评论(0) 推荐(0)
HDOJ-1231 最大连续子序列[DP入门]
摘要：最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11260Accepted Submission(s): 4745Problem De... 阅读全文
posted @ 2012-07-16 16:24 max_xbw 阅读(193) 评论(0) 推荐(0)
HDOJ-1257 最少拦截系统[DP入门]
摘要：最少拦截系统Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8593Accepted Submission(s): 3332Problem Desc... 阅读全文
posted @ 2012-07-16 10:28 max_xbw 阅读(281) 评论(0) 推荐(0)
HDOJ-2084 数塔问题[DP入门]
摘要：数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10651Accepted Submission(s): 6386Problem Descrip... 阅读全文
posted @ 2012-07-16 10:07 max_xbw 阅读(437) 评论(0) 推荐(0)

上一页 1 2