HDU-2844(多重背包中二进制优化）

最新推荐文章于 2022-09-09 22:07:37 发布

最光阴.

最新推荐文章于 2022-09-09 22:07:37 发布

阅读量603

点赞数 1

分类专栏：动态规划

本文链接：https://blog.csdn.net/qq_36346262/article/details/68216150

版权

动态规划专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn't know the exact price of the watch.

You are to write a program which reads n,m,A1,A2,A3...An and C1,C2,C3...Cn corresponding to the number of Tony's coins of value A1,A2,A3...An then calculate how many prices(form 1 to m) Tony can pay use these coins.
Input
The input contains several test cases. The first line of each test case contains two integers n(1 ≤ n ≤ 100),m(m ≤ 100000).The second line contains 2n integers, denoting A1,A2,A3...An,C1,C2,C3...Cn (1 ≤ Ai ≤ 100000,1 ≤ Ci ≤ 1000). The last test case is followed by two zeros.
Output
For each test case output the answer on a single line.
Sample Input
3 10
1 2 4 2 1 1
2 5
1 4 2 1
0 0
Sample Output
8

这是一道多重背包问题，可以讲硬币的价值给变成重量与价值都为同一值的背包，然后就转化为了一道多重背包问题。不过如果直接按照多重背包来做，就会超时的，所以必须在多重背包的基础上加上二进制优化。

不用二进制优化的多重背包，就是暴力的去把同样类型的背包去当做0,1背包来做。不过其中可以加上二进制优化。

二进制优化基于数论的一个知识，任意的一个整数中的任意的一个书都可以由，所有不大于这个整数的的2的n方的数组合而成。

例如 17 = 1 + 2 + 4 + 8 + 2； 17 中的任意数都可以由1,2,4,8,2组合而出.

再例如：53 = 1 + 2 + 4 + 8 + 16 + 20；也同样如此，所以可以基于此对此进行优化。将k个背包拆成0.1背包的形式。

#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
int n, m;
int v[105];
int num[105];
int dp[100010];
int main()
{
   while(true) {
    scanf("%d%d", &n, &m);
    if(n == 0 && m == 0) break;
    for (int i = 0; i < n; i++)
      scanf("%d", &v[i]);
    for (int i = 0; i < n; i++)
      scanf("%d", &num[i]);
    memset(dp, 0, sizeof(dp));
    for (int i = 0; i < n; i++) {
      int cnt = num[i];
      for (int k = 1; k <= cnt; k <<= 1) {
        for (int j = m; j >= k * v[i]; j--) {
          dp[j] = max(dp[j], dp[j - k*v[i]] + k * v[i]);
        }
        cnt -= k;
      }
      if(cnt) for (int j = m; j >= cnt * v[i]; j--)
        dp[j] = max(dp[j], dp[j-cnt*v[i]] + cnt * v[i]);
      }
      int sum = 0;
      for (int i = 1; i <= m; i++) {
        if(dp[i] == i) sum++;
      }
      printf("%d\n", sum);
  }
  return 0;
}