POJ 1276 Cash Machine 多重背包O(n*m)算法

Cash Machine

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 31407		Accepted: 11288

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

题意：在不超过m的情况下， 然后给出n，代表n个方案，接着n对代表个数与价值，要求最接近m；

思路：非常经典的多重背包，以下是多重背包的O(n*m)算法；

代码：

#include<cstdio>  
#include<cstring>
#include <algorithm>
#include <cmath>
using namespace std;  
#define maxn 100007
#define inf 0x3f3f3f3f
typedef long long LL;
int num[20],value[20],sum[maxn];
bool f[maxn];
int main()  
{  
#ifdef CDZSC_June
    freopen("t.txt", "r", stdin);  
#endif  
	int n,m;
	while(~scanf("%d",&m))
	{	
		memset(f,false,sizeof(f));
		scanf("%d",&n);
		for(int i = 0; i<n; i++)
		{
			scanf("%d%d",&num[i],&value[i]);
		}
		f[0] = true;
		for(int i = 0; i<n; i++)
		{
			memset(sum,0,sizeof(sum));//每次初始化时为了防止之前的sum[]会影响后面的sum[]
			for(int j = value[i]; j<=m; j++)
			{
				if(!f[j] && f[j-value[i]] && sum[j-value[i]] < num[i]){//判断当前的j能否放入value[i]
					f[j] = true;
					sum[j] = sum[j-value[i]] +1;
				}
			}
		}
		int max1;
		for(int j = m; j>=0; j--)
		{
			if(f[j]){
				max1 = j;
				break;
			}
		}
		printf("%d\n",max1);
	}
    return 0;  
}