多重背包 Piggy_Bank_1114

多重背包和01背包的区别在于，多重背包中的物品可以放入多次，只要不超过限制。

01背包的内部循环是逆序的， 是因为这样可以保证，每个物品是放入一次的（循环到 j 时，j - c[i] 位置还没有放物品i）。

而多重背包只是把循环颠倒，改为正序循环。(这样在循环到 j 时，j-c[i] 处已经放置了物品i， 这样就可以多次放入物品i 了)。

练习题：

http://acm.hdu.edu.cn/showproblem.php?pid=1114

Piggy-Bank

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7152Accepted Submission(s): 3547

Problem Description

Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple. Whenever some ACM member has any small money, he takes all the coins and throws them into a piggy-bank. You know that this process is irreversible, the coins cannot be removed without breaking the pig. After a sufficiently long time, there should be enough cash in the piggy-bank to pay everything that needs to be paid.

But there is a big problem with piggy-banks. It is not possible to determine how much money is inside. So we might break the pig into pieces only to find out that there is not enough money. Clearly, we want to avoid this unpleasant situation. The only possibility is to weigh the piggy-bank and try to guess how many coins are inside. Assume that we are able to determine the weight of the pig exactly and that we know the weights of all coins of a given currency. Then there is some minimum amount of money in the piggy-bank that we can guarantee. Your task is to find out this worst case and determine the minimum amount of cash inside the piggy-bank. We need your help. No more prematurely broken pigs!

Input

The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing two integers E and F. They indicate the weight of an empty pig and of the pig filled with coins. Both weights are given in grams. No pig will weigh more than 10 kg, that means 1 <= E <= F <= 10000. On the second line of each test case, there is an integer number N (1 <= N <= 500) that gives the number of various coins used in the given currency. Following this are exactly N lines, each specifying one coin type. These lines contain two integers each, Pand W (1 <= P <= 50000, 1 <= W <=10000). P is the value of the coin in monetary units, W is it's weight in grams.

Output

Print exactly one line of output for each test case. The line must contain the sentence "The minimum amount of money in the piggy-bank is X." where X is the minimum amount of money that can be achieved using coins with the given total weight. If the weight cannot be reached exactly, print a line "This is impossible.".

Sample Input

  

   3
10 110
2
1 1
30 50
10 110
2
1 1
50 30
1 6
2
10 3
20 4
  

Sample Output

  

   The minimum amount of money in the piggy-bank is 60.
The minimum amount of money in the piggy-bank is 100.
This is impossible.
  

Java代码：

import java.util.Arrays;
import java.util.Scanner;

public class Piggy_Bank_1114 {
	
	static int n;
	static int max;
	static int[] parr = new int[501];
	static int[] warr = new int[501];
	static int[] opt;
	static int maxInt = 10000000;
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		n = scan.nextInt();
		int max;
		int p,w;
		while(n-- > 0){
			max = Math.abs( scan.nextInt() - scan.nextInt() );
			int m = scan.nextInt();
			opt = new int[max + 1];
			for( int i=0; i<m; i++){
				parr[i] = scan.nextInt();
				warr[i] = scan.nextInt();
			}
			
			Arrays.fill(opt, maxInt);
			opt[0] = 0;
			for(int i=0; i<m; i++){

				for(int j=warr[i]; j <= max; j++)
				{
					if(opt[j] > opt[j - warr[i] ] + parr[i])
						opt[j] = opt[j - warr[i] ] + parr[i];
				}
			}
			
			if(opt[max] == maxInt)
				System.out.println("This is impossible.");
			else
				System.out.println("The minimum amount of money in the piggy-bank is " + opt[max] + ".");
		
		}
	}
}