HDU-2844-Coins(多重背包)
来源:互联网 发布:java 获取方法的泛型 编辑:程序博客网 时间:2024/04/30 12:28
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
Source
2009 Multi-University Training Contest 3 - Host by WHU
思路:经典背包问题。
#include <cstdio>#include <algorithm>using namespace std;int d[105],c[105],dp[100005];int main(){ int n,m,i,j,k,ans; while(~scanf("%d%d",&n,&m) && n+m) { for(i=0;i<n;i++) scanf("%d",&d[i]); for(i=0;i<n;i++) scanf("%d",&c[i]); for(i=0;i<=m;i++) dp[i]=0; for(i=0;i<n;i++) { if(d[i]*c[i]>=m) { for(j=d[i];j<=m;j++) dp[j]=max(dp[j],dp[j-d[i]]+d[i]); } else { k=1; while(((k<<1)-1)<=c[i]) { for(j=m;j>=k*d[i];j--) dp[j]=max(dp[j],dp[j-k*d[i]]+k*d[i]); k<<=1; } if(k-1<c[i]) { k=(c[i]-k+1)*d[i]; for(j=m;j>=k;j--) dp[j]=max(dp[j],dp[j-k]+k); } } } ans=0; for(i=1;i<=m;i++) if(dp[i]==i) ans++; printf("%d\n",ans); }}
1 0
- 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(多重背包)
- HDU 2844(Coins)多重背包
- hdu 2844 Coins (多重背包)
- HDU - 2844 Coins(多重背包)
- HDU 2844 Coins 多重背包
- hdu 2844 coins 多重背包
- hdu 2844 Coins【多重背包】
- HDU 2844-Coins(多重背包)
- sgu107:987654321 problem
- myeclipse debug模式提示 source not found
- ACM-高精度数
- 对java中equals和hashCode函数的一些理解
- 如何学习一门新的编程语言
- HDU-2844-Coins(多重背包)
- java螺旋方阵实现
- LeetCode: Validate Binary Search Tree
- JavaSE 之 如何将一个用逗号分隔的字符串转换成字符数组
- 图形用户界面设计-基本控件 java实验报告第四个
- Android开发入门——Socket编程简单介绍
- 1.1.2 Greedy Gift Givers【贪心】
- Android 动画框架详解1
- 每一个综艺,每一颗星辰