随笔分类 -  动态规划--背包问题

HDU 6092 Rikka with Subset
摘要：Rikka with Subset Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 837 Accepted Submission(s): 411 阅读全文
posted @ 2017-08-09 09:37 勿忘初心0924 阅读(149) 评论(0) 推荐(0) 编辑
Pick apples(大范围贪心，小范围完全背包)
摘要：Pick apples Time Limit: 1000MS Memory Limit: 165536KB Submit Statistic Discuss Problem Description Once ago, there is a mystery yard which only produc 阅读全文
posted @ 2017-04-27 19:28 勿忘初心0924 阅读(626) 评论(0) 推荐(0) 编辑
Piggy-Bank
摘要：Piggy-Bank Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Piggy-Bank Submit Status Description Before ACM can do a 阅读全文
posted @ 2017-03-14 22:15 勿忘初心0924 阅读(201) 评论(0) 推荐(0) 编辑
The Balance
摘要：The Balance Problem Description Now you are asked to measure a dose of medicine with a balance and a number of weights. Certainly it is not always ach 阅读全文
posted @ 2017-02-16 07:34 勿忘初心0924 阅读(232) 评论(0) 推荐(0) 编辑
FATE
摘要：FATE Problem Description 最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得 阅读全文
posted @ 2017-02-11 04:51 勿忘初心0924 阅读(200) 评论(0) 推荐(0) 编辑
Holding Bin-Laden Captive!（1.多重背包 2.母函数）
摘要：Holding Bin-Laden Captive! Problem Description We all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recent 阅读全文
posted @ 2017-02-01 22:11 勿忘初心0924 阅读(336) 评论(0) 推荐(0) 编辑
HDU 3732 Ahui Writes Word
摘要：Ahui Writes Word Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2856 Accepted Submission(s): 101 阅读全文
posted @ 2016-10-24 19:36 勿忘初心0924 阅读(209) 评论(0) 推荐(0) 编辑
2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest J. Bottles
摘要：J. Bottles time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output J. Bottles time limit per tes 阅读全文
posted @ 2016-10-23 21:31 勿忘初心0924 阅读(264) 评论(0) 推荐(0) 编辑
关于01背包和完全背包二重循环的顺序（前人之技，后人惊叹）
摘要：01背包： for(int I=1;i for(int j=v;j>=cost[i];j--) dp[j]=max(d[j],dp[I-cost[i]]+weight[I]); 为什么要从后往前循环！！！！ 因为吧，从后往前循环，每次取得状态不会和你之前取得状态重合，这样就符合01背包的要求，每种物 阅读全文
posted @ 2016-08-02 10:40 勿忘初心0924 阅读(890) 评论(0) 推荐(0) 编辑
关于01背包求第k优解
摘要：引用：http://szy961124.blog.163.com/blog/static/132346674201092775320970/ 求次优解、第K优解 对于求次优解、第K优解类的问题，如果相应的最优解问题能写出状态转移方程、用动态规划解决，那么求次优解往往可以相同的 复杂度解决，第K优解则 阅读全文
posted @ 2016-07-31 18:35 勿忘初心0924 阅读(512) 评论(0) 推荐(0) 编辑