hdu 三部曲 Cash Machine

Problem 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

********************************************************************************************

多重背包（要压缩）

********************************************************************************************

 1 #include<iostream>
 2 #include<string>
 3 #include<cstring>
 4 #include<queue>
 5 #include<cstdio>
 6 using namespace std;
 7 int dp[100005];
 8 int n,m,i,j,k;
 9 int num[1005];
10 int a[1005];
11 void zeropack(int cost,int val)//01背包
12  {
13      for(int it=n;it>=cost;it--)
14        dp[it]=max(dp[it],dp[it-cost]+val);
15  }
16 void  completepack(int cost,int val)//完全背包
17      {
18          for(int it=cost;it<=n;it++)
19           dp[it]=max(dp[it],dp[it-cost]+val);
20      }
21 void  multipack(int cost,int val,int amount)//多重背包(其实是完全背包和01背包的组合)注意下面的写法
22     {
23         if(val*amount>n)
24          completepack(cost,val);
25         else
26           {
27               int k=1;
28               while(k<amount)
29                {
30                    zeropack(cost*k,val*k);
31                    amount-=k;
32                    k=(k<<1);
33                }
34               zeropack(cost*amount,val*amount);
35           }
36     }
37 int  main()
38  {
39      while(scanf("%d %d",&n,&m)!=EOF)
40      {
41         memset(dp,0,sizeof(dp));
42         for(i=1;i<=m;i++)
43          {
44           scanf("%d %d",&num[i],&a[i]);
45           multipack(a[i],a[i],num[i]);
46          }
47       printf("%d\n",dp[n]);
48      }
49     return 0;
50 
51  }

View Code

坚持！！！！！！！！！！

转载于:https://www.cnblogs.com/sdau--codeants/p/3295317.html