poj 1276 多重背包

题目：

Cash Machine

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 35827		Accepted: 12988

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.

Source

给一个出钞总额cash和N种货币，每种货币给定面值和数目，选择一些货币使得面值和不超过cash且尽量大

分析：

多重背包问题定义：

有N种物品和一个容量为V的背包。第i种物品最多有n[i]件可用，每件费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。

本题中钞票的面值即费用，也是价值 因此问题可重新描述为 给定n种钞票的数目，费用，价值，从中选择一些钞票装入背包使得费用总和<=cash且价值总和最大 

由于不要求装满 只需初始化为零

代码：

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
const int inf=0x7f7f7f7f;
const int maxn=100050;

int val[20],cost[20],num[20],dp[maxn];
int t,n,v;

inline void compak(int val,int cost){
    for(int i=cost;i<=v;++i){
        dp[i]=max(dp[i],dp[i-cost]+val);
    }
}

inline void zeroone(int val,int cost){
    for(int i=v;i>=cost;--i){
        dp[i]=max(dp[i],dp[i-cost]+val);
    }
}

inline void mulpak(int val,int cost,int num){
    if(cost*num>=v){///这种物品费用总和大于V 相当于在V的范围内可以任取多件 转化为完全背包问题
        compak(val,cost);
        return;
    }
    int k=1;
    while(k<num){
        zeroone(k*val,k*cost);
        num-=k;
        k<<=1;///zz般的写成了k<=1; ...............
        //cout<<"k="<<k<<endl;
    }
    zeroone(num*val,num*cost);
}

int main(){///1068K	47MS
    while(scanf("%d%d",&v,&n)==2){
        for(int i=1;i<=n;++i) scanf("%d%d",&num[i],&cost[i]),val[i]=cost[i];
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;++i) mulpak(val[i],cost[i],num[i]);
        printf("%d\n",dp[v]);
    }
    return 0;
}