背包问题
文章平均质量分 83
青苹之末
要走就要一个人走到底
展开
-
hdu 1059 多重背包问题 Dividing
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13188 Accepted Submission(s): 3691Problem DescriptionMarsha and Bill原创 2013-08-19 15:24:11 · 649 阅读 · 0 评论 -
Coins hdu 多重背包 2844
CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5281 Accepted Submission(s): 2171Problem DescriptionWhuacmers use coins.They原创 2013-08-14 15:41:53 · 652 阅读 · 0 评论 -
饭卡 hdu 2546
饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7363 Accepted Submission(s): 2510Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前原创 2013-08-14 19:47:25 · 681 阅读 · 0 评论 -
hdu 2191 完全背包
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10802 Accepted Submission(s): 4572Problem Description急!灾原创 2013-08-14 10:28:35 · 736 阅读 · 0 评论 -
多重背包问题
P03: 多重背包问题题目有N种物品和一个容量为V的背包。第i种物品最多有n[i]件可用,每件费用是c[i],价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。基本算法这题目和完全背包问题很类似。基本的方程只需将完全背包问题的方程略微一改即可,因为对于第i种物品有n[i]+1种策略:取0件,取1件……取n[i]件。令f[i][v]表示前转载 2013-08-14 14:25:19 · 729 阅读 · 0 评论 -
寒冰王座 hdu 完全背包版本
寒冰王座Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8529 Accepted Submission(s): 4301Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票原创 2013-08-11 20:42:07 · 689 阅读 · 0 评论 -
I NEED A OFFER! hdu 1203 01 背包
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12758 Accepted Submission(s): 4936Problem DescriptionSpeakless很早就想原创 2013-08-07 23:39:47 · 687 阅读 · 0 评论 -
Piggy-Bank hdu 1114
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8455 Accepted Submission(s): 4266Problem DescriptionBefore ACM can do a原创 2013-08-07 20:11:28 · 601 阅读 · 0 评论 -
背包问题 入门 hdu 2602
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21555 Accepted Submission(s): 8674Problem DescriptionMany years原创 2013-08-06 18:43:23 · 675 阅读 · 0 评论 -
多重背包模板解析 (二进制优化)
#include#include#include#define N 1000 //物品个数 #define M 100000000 //所有物品可能的最大价值 int m[N],c[N],w[N],f[M];int V;int max(int a,int b){return a>b?a:b;}void ZeroOnePack(int cost,原创 2013-08-14 20:18:50 · 750 阅读 · 0 评论