HDU ACM 2844 Coins (多重背包)----------------01背包,完全背包,多重背包模板

http://acm.hdu.edu.cn/showproblem.php?pid=2844

 

多重背包问题.

求出恰好能买的数目.最后找f[i]>0的背包有几个

或者

不需要恰好装满,最后搜索f[i] == i 的数目

 1 #include <iostream>
 2 using namespace std;
 3 const int MAX = 100000 + 10;
 4 const int INF = 0x7fffffff;
 5 int f[MAX];
 6 int v;
 7 void ZeroOnePack(int cost,int weight)
 8 {
 9     int i;
10     for(i=v;i>=cost;i--)
11     {
12         f[i] = max(f[i],f[i-cost]+weight);
13     }
14 }
15 void CompletePack(int cost,int weight)
16 {
17     int i;
18     for(i=cost;i<=v;i++)
19     {
20         f[i] = max(f[i],f[i-cost]+weight);
21     }
22 }
23 void MultiplePack(int cost,int weight,int amount)
24 {
25     if(v <= cost*amount)
26     {
27         CompletePack(cost,weight);
28         return;
29     }
30     else
31     {
32         int k = 1;
33         while(k<amount)
34         {
35             ZeroOnePack(k*cost,k*weight);
36             amount = amount - k;
37             k = k*2;
38         }
39         ZeroOnePack(amount*cost,amount*weight);
40     }
41 }
42 int main()
43 {
44     int n;
45     while(cin>>n>>v,n+v)
46     {
47         int c[MAX];
48         int a[MAX];
49         int i;
50         for(i=0;i<n;i++)
51         {
52             cin>>c[i];
53         }
54         for(i=0;i<n;i++)
55         {
56             cin>>a[i];
57         }
58         for(i=0;i<=v;i++)
59         {
60             f[i] = -1*INF;
61         }
62         f[0] = 0;
63         for(i=0;i<n;i++)
64         {
65             MultiplePack(c[i],c[i],a[i]);
66         }
67         int sum = 0;
68         for(i=1;i<=v;i++)
69         {
70             if(f[i] > 0)
71             {
72                 sum++;
73             }
74         }
75         cout<<sum<<endl;
76     }
77     return 0;
78 }

 

来源：https://www.cnblogs.com/zxotl/archive/2012/09/12/2682008.html