随笔分类 -  DP之背包问题

[USACO 3.1.6]邮票【同上：还是完全背包】CSUST 1084
摘要：1084: [USACO 3.1.6]邮票Time Limit:1 SecMemory Limit:64 MBSubmit:122Solved:33SubmitStatusWeb BoardDescription已知一个 N 枚邮票的面值集合（如，{1 分，3 分}）和一个上限 K —— 表示信封上能够贴 K 张邮票。计算从 1 到 M 的最大连续可贴出的邮资。 例如，假设有 1 分和 3 分的邮票；你最多可以贴 5 张邮票。很容易贴出 1 到 5 分的邮资（用 1 分邮票贴就行了），接下来的邮资也不难：6 = 3 + 37 = 3 + 3 + 18 = 3 + 3 + 1 + 19 = 3 阅读全文
posted @ 2013-05-03 20:02 free斩 阅读(241) 评论(0) 推荐(0)
[USACO 2.3.4]货币系统【DP完全背包的简单应用】CSUST 1081
摘要：CSUST 10811081: [USACO 2.3.4]货币系统Time Limit:1 SecMemory Limit:64 MBSubmit:142Solved:54SubmitStatusWeb BoardDescription母牛们不但创建了他们自己的政府而且选择了建立了自己的货币系统。 [In their own rebellious way],，他们对货币的数值感到好奇。传统地，一个货币系统是由1,5,10,20 或 25,50, 和 100的单位面值组成的。母牛想知道有多少种不同的方法来用货币系统中的货币来构造一个确定的数值。举例来说, 使用一个货币系统 {1,2,5,10,. 阅读全文
posted @ 2013-05-03 18:40 free斩 阅读(336) 评论(0) 推荐(0)
POJ 3624【水01背包】
摘要：原题链接：http://poj.org/problem?id=3624我的链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=20437#problem/A欢迎来水Charm BraceletTime Limit:1000MSMemory Limit:65536KTotal Submissions:14963Accepted:6840DescriptionBessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she 阅读全文
posted @ 2013-03-13 22:08 free斩 阅读(160) 评论(0) 推荐(0)
hdu 2955 Robberies
摘要：DP（关于抢银行概率的那道==）题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2955RobberiesTime Limit: 2000/1000 MS(Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s):4778Accepted Submission(s): 1808Problem DescriptionThe aspiringRoy the Robberhas seen a lot of American movies, and knows that 阅读全文
posted @ 2012-09-06 18:46 free斩 阅读(271) 评论(0) 推荐(0)
hdu 2955 Robberies【经典01背包】
摘要：DP（关于抢银行概率的那道==）题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2955RobberiesTime Limit: 2000/1000 MS(Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s):4778Accepted Submission(s): 1808Problem DescriptionThe aspiringRoy the Robberhas seen a lot of American movies, and knows that 阅读全文
posted @ 2012-09-06 18:46 free斩 阅读(117) 评论(0) 推荐(0)
POJ 2063 Investment
摘要：快速链接：http://poj.org/problem?id=2063CSUST 2012年暑假8月组队后第八次个人赛：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11473#problem/DInvestmentTime Limit:1000MSMemory Limit:30000KTotal Submissions:5370Accepted:1848DescriptionJohn never knew he had a grand-uncle, until he received the notary's le 阅读全文
posted @ 2012-08-15 14:06 free斩 阅读(266) 评论(0) 推荐(0)
POJ 2063 Investment【经典完全背包】
摘要：DP背包（注意减少内存的转换）快速链接：http://poj.org/problem?id=2063CSUST 2012年暑假8月组队后第八次个人赛：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11473#problem/DInvestmentTime Limit:1000MSMemory Limit:30000KTotal Submissions:5370Accepted:1848DescriptionJohn never knew he had a grand-uncle, until he received the 阅读全文
posted @ 2012-08-15 13:35 free斩 阅读(194) 评论(0) 推荐(0)
hdu 1114 Piggy-Bank【完全背包】
摘要：经典完全背包入门题目题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1114Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5450Accepted Submission(s): 2714Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financ 阅读全文
posted @ 2012-08-14 15:41 free斩 阅读(145) 评论(0) 推荐(0)
hdu 1114 Piggy-Bank（完全背包）
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1114Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5450Accepted Submission(s): 2714Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial suppor 阅读全文
posted @ 2012-08-14 15:41 free斩 阅读(177) 评论(0) 推荐(0)
背包九讲
摘要：感谢作者，感谢百度文库，原文下载地址：http://wenku.baidu.com/view/8b3c0d778e9951e79b892755.html###背包问题九讲v1.0目录第一讲01背包问题第二讲完全背包问题第三讲多重背包问题第四讲混合三种背包问题第五讲二维费用的背包问题第六讲分组的背包问题第七讲有依赖的背包问题第八讲泛化物品第九讲背包问题问法的变化附：USACO中的背包问题前言本篇文章是我(dd_engi)正在进行中的一个雄心勃勃的写作计划的一部分，这个计划的内容是写作一份较为完善的NOIP难度的动态规划总结，名为《解动态规划题的基本思考方式》。现在你看到的是这个写作计划最先发布的 阅读全文
posted @ 2012-08-14 15:20 free斩 阅读(180) 评论(0) 推荐(0)
hdu 2602 Bone Collector (01背包经典入门)
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2602 Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13839Accepted Submission(s): 5454Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was ca... 阅读全文
posted @ 2012-08-14 14:45 free斩 阅读(284) 评论(0) 推荐(0)
hdu 2602 Bone Collector（01背包）
摘要：最经典、最基础的01背包入门题目题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2602Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13839Accepted Submission(s): 5454Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called 阅读全文
posted @ 2012-08-14 14:45 free斩 阅读(121) 评论(0) 推荐(0)
hdu 2602 Bone Collector【01背包】
摘要：最经典、最基础的01背包入门题目题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2602Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13839Accepted Submission(s): 5454Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called 阅读全文
posted @ 2012-08-14 14:45 free斩 阅读(140) 评论(0) 推荐(0)