POJ 1276 多重背包

原创 2015年11月18日 15:49:13

Cash Machine
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 30375 Accepted: 10950
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.
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.
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 350
633 4 500 30 6 100 1 5 0 1
735 0
0 3 10 100 10 50 10 10
Sample Output

735
630
0
0
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.

题意:
有几种货币,给出货币的价值和数量。从中挑一些使得总和最接近给定的数字。
解法:
多重背包裸题。

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;
//dp[i]不超过i能取得的最大值
//dp[j] = max(dp[j],dp[j-v[i]]+v[i]);
int dp[100010];
int a[100000];
int v[100000];

int main(){
    int cash,n;
    while(scanf("%d%d",&cash,&n)!=EOF){
        int i,j,k;
        for(i = 1;i<=n;i++)
            scanf("%d%d",&a[i],&v[i]);

        memset(dp,0,sizeof(dp));
        for(i = 1;i<=n;i++){
            if(a[i]*v[i]>=cash){
                for(j = v[i];j<=cash;j++)
                    dp[j] = max(dp[j],dp[j - v[i]] + v[i]);
            }else{
                k = 1;
                while(k<a[i]){
                    for(j = cash;j>=k*v[i];j--){
                        dp[j] = max(dp[j],dp[j - k*v[i]] + k*v[i]);
                    }
                    a[i]-=k;
                    k<<=1;
                }
                for(j = cash;j>=a[i]*v[i];j--)
                    dp[j] = max(dp[j],dp[j - a[i]*v[i]] + a[i]*v[i]);
            }
        }
        printf("%d\n",dp[cash]);
    }
    return 0;
}
版权声明:博客迁移到 yaokun.wiki

相关文章推荐

HDU 1081 最大矩形和

To The Max Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Tot...

动态规划 多重背包 优化 poj 1276

题意: 这道题的意思是给你一堆钱,各种面值的都有,比如10块的5张,5块的3张,2块的1张,请找出利用这些钱可以凑成的最接近且小于给定的数字cash的数额,比如cash=33块。我们可以取3张10块...

POJ 1276 - Cash Machine(多重背包)

Description A Bank plans to install a machine for cash withdrawal. The machine is able to deliver...

POJ1276:Cash Machine(多重背包)

Description A Bank plans to install a machine for cash withdrawal. The machine is able to deliver a...

POJ - 1276 Cash Machine 多重背包模板题

Cash Machine Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 34097   ...
  • jerans
  • jerans
  • 2017年02月07日 21:46
  • 92

POJ 1276 Cash Machine(多重背包)

Description A Bank plans to install a machine for cash withdrawal. The machine is able to deliver ap...

POJ 1276 Cash Machine【多重背包】

题意:有各种不同面值的货币,每种面值的货币有不同的数量,请找出利用这些货币可以凑成的最接近且小于等于给定的数字cash的金额. 样例1: 要取735,取款机内有3种钱:4张125的,6张5的,3张35...

POJ 1276 Cash Machine 多重背包

Cash Machine Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31470   Accepted: 11...

Cash Machine----POJ_1276----多重背包

题目地址:http://poj.org/problem?id=1276 Cash Machine Time Limit: 1000MS   Memory Limit: ...
  • dr5459
  • dr5459
  • 2012年07月20日 09:24
  • 448
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1276 多重背包
举报原因:
原因补充:

(最多只允许输入30个字)