poj 1276 Cash Machin（混合背包）-CSDN博客

本文链接：https://blog.csdn.net/u011721440/article/details/17513617

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 25941		Accepted: 9139

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

题解：因为物品数量不定，根据物品和背包的大小关系分为01和完全背包两种；其中，要把物品数量很大但又达不到完全背包的物品拆分成01背包。如物品大小为13，可以分拆为1，2，4，6；其中前三种可以组成1-7之间的任意数字。

最后学习背包问题，推荐背包9讲。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define N 100005
int m,f[N];
void Zeroone(int c,int w)          // 01背包
{
	int i;
	for(i=m;i>=c;i--)
		f[i]=max(f[i],f[i-c]+w);
}
void Comple(int c,int w)       //完全背包
{
	int i;
	for(i=c;i<=m;i++)
	    f[i]=max(f[i],f[i-c]+w);
}
void Multi(int c,int w,int num)     //多重背包
{
	if(c*num>=m)
	    Comple(c,w);
	else
	{
		int i=1;           //二进制思想，用一些数表示所有可能的组合。
		while(i<=num)
		{
	                Zeroone(i*c,i*w);  //如num=13，可以用1，2,4,6表示所有组合
			num-=i;
			i*=2;
		}
		if(num){
                    Zeroone(c*num,w*num);
		}
	}
}
int main()
{
	int i,n;
	int num[1005],cost[1005];
	while(scanf("%d",&m)!=EOF)
	{
		memset(f,0,sizeof(f));
		scanf("%d",&n);
		for(i=0;i<n;i++)
			scanf("%d%d",&num[i],&cost[i]);
		for(i=0;i<n;i++)
			Multi(cost[i],cost[i],num[i]);
		printf("%d\n",f[m]);
	}
	return 0;
}