2012年8月14日
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 Read More
posted @ 2012-08-14 15:41 free斩 Views(168) Comments(0) Diggs(0) Edit
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 Read More
posted @ 2012-08-14 15:41 free斩 Views(135) Comments(0) Diggs(0) Edit
hdu 1058 Humble Numbers（丑数）
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1058Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9933Accepted Submission(s): 4291Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequ Read More
posted @ 2012-08-14 15:31 free斩 Views(182) Comments(0) Diggs(0) Edit
hdu 1058 Humble Numbers【丑数】
DP&&英语==题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1058Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9933Accepted Submission(s): 4291Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble Read More
posted @ 2012-08-14 15:31 free斩 Views(120) Comments(0) Diggs(0) Edit
背包九讲
感谢作者，感谢百度文库，原文下载地址：http://wenku.baidu.com/view/8b3c0d778e9951e79b892755.html###背包问题九讲v1.0目录第一讲01背包问题第二讲完全背包问题第三讲多重背包问题第四讲混合三种背包问题第五讲二维费用的背包问题第六讲分组的背包问题第七讲有依赖的背包问题第八讲泛化物品第九讲背包问题问法的变化附：USACO中的背包问题前言本篇文章是我(dd_engi)正在进行中的一个雄心勃勃的写作计划的一部分，这个计划的内容是写作一份较为完善的NOIP难度的动态规划总结，名为《解动态规划题的基本思考方式》。现在你看到的是这个写作计划最先发布的 Read More
posted @ 2012-08-14 15:20 free斩 Views(168) Comments(0) Diggs(0) Edit
hdu 2084 数塔
题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=2084数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11282Accepted Submission(s): 6761Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个D Read More
posted @ 2012-08-14 14:55 free斩 Views(113) Comments(0) Diggs(0) Edit
hdu 1176 免费馅饼（类似于hdu 2084 数塔那道题目 ）
题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=1176免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14396Accepted Submission(s): 4763Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果 Read More
posted @ 2012-08-14 14:50 free斩 Views(158) Comments(0) Diggs(0) Edit
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 Read More
posted @ 2012-08-14 14:45 free斩 Views(115) Comments(0) Diggs(0) Edit
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... Read More
posted @ 2012-08-14 14:45 free斩 Views(274) Comments(0) Diggs(0) Edit
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 Read More
posted @ 2012-08-14 14:45 free斩 Views(134) Comments(0) Diggs(0) Edit