poj 1276 Cash Machine(多重背包)
来源:互联网 发布:景甜到底什么来头知乎 编辑:程序博客网 时间:2024/05/21 11:24
题目链接:http://poj.org/problem?id=1276
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.
Source
Southeastern Europe 2002
多重背包模板。。。
代码:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int maxn=100005;int dp[maxn];int v[maxn];int n[maxn];int cash,N;void ZeroOnePack(int cost){ for(int v=cash;v>=cost;v--) dp[v]=max(dp[v],dp[v-cost]+cost);} void CompletePack(int cost){ for (int v=cost;v<=cash;v++) dp[v]=max(dp[v],dp[v-cost]+cost);}void MultiplePack(int cost,int amount){ if (cost*amount>=cash) { CompletePack(cost); } else { int k=1; while(k<amount) { ZeroOnePack(k*cost); amount=amount-k; k=k*2; } ZeroOnePack(amount*cost); }}int main(){ //freopen("in.txt","r",stdin); while(scanf("%d %d",&cash,&N)==2) { memset(dp,0,sizeof(dp)); for(int i=0;i<N;i++) scanf("%d %d",&n[i],&v[i]); for(int i=0;i<N;i++) MultiplePack(v[i],n[i]); printf("%d\n",dp[cash]); } return 0;}
0 0
- POJ 1276 Cash Machine (多重背包)
- POJ 1276 Cash Machine (多重背包)
- 【POJ】1276 Cash Machine(多重背包)
- poj 1276 Cash Machine(多重背包)
- poj 1276 Cash Machine(多重背包)
- POJ - 1276 Cash Machine(多重背包)
- POJ 1276 - Cash Machine(多重背包)
- POJ 1276 Cash Machine(多重背包)
- POJ 1276 Cash Machine(多重背包)
- POJ 1276 Cash Machine (多重背包)
- POJ-1276-Cash Machine(多重背包)
- POJ 1276 Cash Machine(多重背包)
- Cash Machine poj 1276(多重背包)
- poj 1276 Cash Machine (多重背包)
- POJ 1276 Cash Machine (多重背包)
- POJ 1276 Cash Machine(多重背包)
- POJ 1276:Cash Machine (多重背包)
- POJ 1276 Cash Machine(多重背包)
- 使用ntpdate校正Linux系统的时间
- 交通灯管理系统
- Crocus Technology 公司介绍
- js判断上传文件大小
- JqGird 事件 方法(二)
- poj 1276 Cash Machine(多重背包)
- range
- SVN服务器搭建和使用(三)
- android设置字体为LED数字样式
- 修改linux文件权限命令:chmod
- 设计模式16——Memento设计模式
- memcache初步探索
- POJ 聪明的打字员
- 职场生存 3个自我息怒小技巧