背包问题
努力前行吧
这个作者很懒,什么都没留下…
展开
-
【01背包】Bone Collector
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34937 Accepted Submission(s): 14384Problem DescriptionMany year转载 2015-03-25 21:16:33 · 367 阅读 · 0 评论 -
Coins(多重背包+二进制优化)
CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9658 Accepted Submission(s): 3843Problem DescriptionWhuacmers use coins.转载 2015-08-02 11:32:12 · 384 阅读 · 0 评论 -
Dividing(多重背包+二进制优化)
DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 63688 Accepted: 16498DescriptionMarsha and Bill own a collection of marbles. They want to split转载 2015-08-02 09:09:56 · 396 阅读 · 0 评论 -
多重背包的取模优化
取模优化当输入样本特别大时,比如给出上百万件物品,这时候仅靠优化算法仍然不能使运行时间降到满意的范围。可考虑如何减少输入样本。poj1014的discussion上有一个非常巧妙的“取模优化”法。设价值为v(1如果该问题不可分,那么n-2件v仍然不可分,依次类推,用s或 s-1替换n仍然不可分如果该问题可分,即可分成价值相等的两堆。分两种情况考虑:转载 2015-08-01 18:37:17 · 599 阅读 · 0 评论 -
Tug of War(严格限制数量的二维费用背包)
Tug of WarTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8500 Accepted: 2311DescriptionA tug of war is to be arranged at the local office picnic. For t转载 2015-07-26 15:54:34 · 646 阅读 · 0 评论 -
Watch The Movie(严格限制数量的二维费用背包)
Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 6454 Accepted Submission(s): 2066Problem DescriptionNew semest转载 2015-07-26 20:00:31 · 309 阅读 · 0 评论 -
分组背包问题
转载 2015-06-14 14:21:16 · 462 阅读 · 0 评论 -
采药(01背包)
1753: 采药Time Limit: 0 Sec Memory Limit: 128 MBSubmit: 10 Solved: 8[Submit][Status][Web Board]Description辰辰是个天资聪颖的孩子,他的梦想是成为世界上最伟大的医师。为此,他想拜附近最有威望的医师为师。医师为了判断他的资质,给他出了一个难题。医师把他带到一个到转载 2015-07-25 10:52:46 · 542 阅读 · 0 评论 -
二维费用背包
问题二维费用的背包问题是指:对于每件物品,具有两种不同的费用;选择这件物品必须同时付出这两种代价;对于每种代价都有 一个可付出的最大值(背包容量)。问怎样选择物品可以得到最大的价值。设这两种代价分别为代价1和代价2,第i件物品所需的两种代价分别为a[i]和 b[i]。两种代价可付出的最大值(两种背包容量)分别为V和U。物品的价值为w[i]。算法费用加了一维,只需状态也加一维转载 2015-07-26 15:52:17 · 1083 阅读 · 0 评论 -
FATE(二维费用背包)
FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9596 Accepted Submission(s): 4516Problem Description最近xhd正在玩一款叫做FATE的游戏,为转载 2015-07-26 16:58:59 · 370 阅读 · 0 评论 -
ACboy needs your help(分组背包)
ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4867 Accepted Submission(s): 2621Problem DescriptionACbo转载 2015-06-14 14:22:52 · 338 阅读 · 0 评论 -
Big Event in HDU
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26693 Accepted Submission(s): 9390Problem DescriptionNowaday转载 2015-04-13 18:11:35 · 243 阅读 · 0 评论 -
Piggy-Bank(完全背包)
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13942 Accepted Submission(s): 7067Problem DescriptionBefore ACM can转载 2015-04-05 20:14:00 · 386 阅读 · 0 评论 -
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活(多重背包)
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16780 Accepted Submission(s): 7103Problem Description转载 2015-04-03 20:44:09 · 365 阅读 · 0 评论 -
01背包完全背包多重背包的概念
01背包(ZeroOnePack): 有N件物品和一个容量为V的背包, 每种物品均只有一件。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。 完全背包(CompletePack): 有N种物品和一个容量为V的背包,每种物品都有无转载 2015-04-03 20:42:24 · 321 阅读 · 0 评论 -
钱币兑换问题(完全背包)
钱币兑换问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7465 Accepted Submission(s): 4407Problem Description在一个国家仅有1分,2分,3分硬币,将转载 2015-07-24 16:51:34 · 429 阅读 · 0 评论