Coins (HDU 2844) —— 多重背包
来源:互联网 发布:淘宝视频制作 编辑:程序博客网 时间:2024/06/03 18:55
写这题花了我一天时间,而且还没写出来,故借鉴了别人的文章:http://blog.csdn.net/lyhvoyage/article/details/8777540
基本上就是多重背包的模板了。。
Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6807 Accepted Submission(s): 2771
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
自己跟着也写了。。
#include<stdio.h>int a[110],c[110],dp[100010];int maxn(int i,int j) {return i > j ? i : j;}void CompletePack(int v,int w,int m){ for(int j=v; j<=m; j++) dp[j] = maxn(dp[j],dp[j-v]+w);}void ZeroOnePack(int v,int w,int m){ for(int j=m; j>=v; j--) dp[j] = maxn(dp[j],dp[j-v]+w);}void MultiPack(int v,int w,int m,int c){ if(v*c > m) CompletePack(v,w,m); else { int k = 1; while(k < c) { ZeroOnePack(k*v,k*w,m); c -= k; k *= 2; } ZeroOnePack(c*v,c*w,m); }}int main(){ int i,j,n,m; while(~scanf("%d%d", &n,&m),n+m) { for(i=1; i<=m; i++) dp[i] = 0; for(i=1; i<=n; i++) scanf("%d", a+i); for(i=1; i<=n; i++) scanf("%d", c+i); for(i=1; i<=n; i++) MultiPack(a[i],a[i],m,c[i]); int sum = 0; for(i=1; i<=m; i++) if(dp[i] == i) sum++; printf("%d\n", sum); } return 0;}
0 0
- HDU 2844 Coins——多重背包
- Coins (HDU 2844) —— 多重背包
- hdu(2844)——Coins(多重背包+优化)
- HDU 2844 Coins(多重背包)
- hdu 2844 Coins (多重背包)
- hdu 2844 Coins(多重背包优化)
- [ACM] hdu 2844 Coins (多重背包)
- HDU 2844 Coins (多重背包)
- HDU 2844 Coins(多重背包)
- HDU 2844 Coins (多重背包)
- hdu 2844 Coins(多重背包)
- HDU 2844 Coins (多重背包)
- HDU 2844 Coins (多重背包)
- Coins (hdu 2844)多重背包
- HDU 2844 Coins (多重背包模板)
- hdu 2844 Coins (多重背包问题)
- 【HDU 2844】Coins(多重背包)
- HDU-2844-Coins(多重背包)
- JavaScript 常见陷阱
- 10-hibernate组件关联关系映射
- java @override 报错处理
- 树莓派启动盘制作和备份
- ArrayAdapter(API分析)
- Coins (HDU 2844) —— 多重背包
- poj 1611
- VirtualBox下安装ubuntu出现单个文件超出了4G的提示
- import org.junit.Test;报错处理
- iOS App Archive 版本出错的问题 调试和解决方法
- 2014-7-15任务完成情况
- 截取指定长度的字符串(汉字不出现半个)
- 很好的技术博文推荐(持续更新)
- 用正向和逆向最大匹配算法进行中文分词(续)