poj1276--混合背包
来源:互联网 发布:2016java和c哪个前景好 编辑:程序博客网 时间:2024/05/18 20:09
Cash Machine
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 26904 Accepted: 9504
Description
A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply of nk bills. For example,
N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10
means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.
Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.
Notes:
@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.
N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10
means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.
Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.
Notes:
@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.
Input
The program input is from standard input. Each data set in the input stands for a particular transaction and has the format:
cash N n1 D1 n2 D2 ... nN DN
where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct.
cash N n1 D1 n2 D2 ... nN DN
where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct.
Output
For each set of data the program prints the result to the standard output on a separate line as shown in the examples below.
Sample Input
735 3 4 125 6 5 3 350633 4 500 30 6 100 1 5 0 1735 00 3 10 100 10 50 10 10
Sample Output
73563000
Hint
The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash.
In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash.
In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.
In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash.
In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.
代码:
#include<cstdio>#include<iostream>using namespace std;int num[20],bill[20],dp[100010];void zo_pack(int v,int c){ for(int i=c;i>=v;i--) dp[i]=max(dp[i],dp[i-v]+v);}void cp_pack(int v,int c){ for(int i=v;i<=c;i++) dp[i]=max(dp[i],dp[i-v]+v);}void ml_pack(int n,int v,int c){ if(n*v>=c) {cp_pack(v,c);return;} int k=1; while(k<n){ zo_pack(k*v,c); n-=k; k<<=1; } zo_pack(n*v,c);}int main(){ int n,m; while(~scanf("%d%d",&n,&m)){ for(int i=1;i<=m;i++) scanf("%d%d",num+i,bill+i); for(int i=0;i<=n;i++) dp[i]=0; for(int i=1;i<=m;i++) ml_pack(num[i],bill[i],n); printf("%d\n",dp[n]); } return 0;}
这题是很明显的混合背包问题,上面代码参考《背包九讲》,这份值得orz的资料。
0 0
- poj1276--混合背包
- poj1276 完全背包模板
- poj1276 多重背包
- 北大POJ1276 多重背包
- poj1276(DP多重背包)
- poj1276 多重背包
- poj1276 多重背包
- poj1276 多重背包
- poj1276(多重背包)
- poj1276(多重背包)
- poj1276多重背包
- poj1276 多重背包
- POJ1276【多重背包】
- [背包]poj1276 Cash Machine
- POJ1276 多重背包
- poj1276(Cash Machine + 多重背包)
- POJ1276:Cash Machine(多重背包)
- POJ1276:Cash Machine(多重背包)
- cocos2dx 内存管理
- 图像渲染——Shader
- 大视野1500--splay
- BUPT Summer Journey #test3 A
- 类 RandomAccessFile
- poj1276--混合背包
- 黑马程序员--10--集合框架与泛型
- 机械战警原型开发 - 仓田机器人
- 9
- Android学习之路【转载】
- 模拟QQ图像自定义剪裁功能
- 的萨芬公司的风格斯蒂芬公司地方
- 规划局规划局规划局
- 撒地方公司的分公司地方公司地方噶