动态规划:HDU2844-Coins(多重背包的二进制优化)
来源:互联网 发布:js同时获取多个id 编辑:程序博客网 时间:2024/06/10 08:34
Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9826 Accepted Submission(s): 3916
Problem Description
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.
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 101 2 4 2 1 12 51 4 2 10 0
Sample Output
84
解题心得:1、就是一个多重背包的二进制优化问题,题目要求的是一个最后表价格可能的个数。2、关于多重背包的二进制优化问题(多重背包的二进制优化)
#include<bits/stdc++.h>using namespace std;const int maxn1 = 1e5+100;const int maxn2 = 110;int n,m;bool dp[maxn1];struct Coin{ int num; int va;} c[maxn2];int pre_coin(){ int sum = 0; for(int i=1; i<=n; i++) scanf("%d",&c[i].va); for(int i=1; i<=n; i++) { scanf("%d",&c[i].num); sum += c[i].num * c[i].va; }}int main(){ while(scanf("%d%d",&n,&m) && n+m) { memset(dp,0,sizeof(dp)); dp[0] = true; pre_coin(); for(int i=1; i<=n; i++) { int cnt = 0; for(int k=1; k<=c[i].num; k*=2)//k*=2二进制优化 { cnt = k*c[i].va; for(int j=m; j>=cnt; j--) if(dp[j-cnt]) dp[j] = true; c[i].num -= k; } if(cnt) { cnt = c[i].num * c[i].va; for(int j=m; j>=cnt; j--) { if(dp[j-cnt]) dp[j] = true; } } } int Sum = 0;//记录可能是手表价格的个数 for(int i=m; i>=1; i--) if(dp[i]) Sum ++; printf("%d\n",Sum); }}
阅读全文
0 1
- 动态规划:HDU2844-Coins(多重背包的二进制优化)
- hdu2844 Coins(多重背包+二进制优化)
- hdu2844 Coins (多重背包+二进制优化)
- 动态规划--多重背包--hdu2844 coins
- hdu2844 Coins(多重背包)
- HDU2844-Coins(多重背包)
- HDU2844 Coins(多重背包)
- hdu2844 多重背包+二进制优化
- hdu2844 多重背包+二进制优化(多重背包的完全背包优化解法)
- HDU2844:Coins(多重背包)
- hdu2844 Coins 多重背包
- hdu2844 Coins --多重背包
- hdu2844—Coins(多重背包)
- hdu2844 Coins(多重背包模板题)
- Coins(多重背包+二进制优化)
- [算法]动态规划 多重背包 二进制优化
- 动态规划:HDU1059-Dividing(多重背包问题的二进制优化)
- hdu2844 Coins 多重背包+完全背包
- (假API)后台API没有设计好之前,前端开发用假API不失进度进行数据层开发
- Recycler
- POSIX线程同步
- PHP验证码不显示
- 神经机器翻译(Neural Machine Translation)系列教程
- 动态规划:HDU2844-Coins(多重背包的二进制优化)
- 系统数据字典数据模型设计
- Q_DECLARE_PRIVATE与Q_DECLARE_PUBLIC
- 006
- 单例模式
- linux常用命令 文件操作类
- (1)OFBIZ-安装部署
- Qt Charts编译和使用
- CRC循环冗余校验码