标签：acm hdu 动态规划 完全背包
题意 知道空存钱罐的重量和装满钱的存钱罐的重量及每种币值的重量 求存钱罐里至少有多少钱
裸的完全背包 但是是求最小值 所以初始0要变成初始INF max也要变成min
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 10005, INF = 0x3f3f3f3f;
int val[N], wei[N], d[N];
int main()
{
int cas, t, s, n;
scanf ("%d", &cas);
while (cas--)
{
scanf ("%d%d", &t, &s);
s -= t;
scanf ("%d", &n);
for (int i = 1; i <= n; ++i)
scanf ("%d%d", &val[i], &wei[i]);
memset (d, 0x3f, sizeof (d));
d[0] = 0;
for (int i = 1; i <= n; ++i)
for (int j = wei[i]; j <= s; ++j)
d[j] = min (d[j], d[j - wei[i]] + val[i]);
if (d[s] == INF) printf ("This is impossible.\n");
else printf ("The minimum amount of money in the piggy-bank is %d.\n", d[s]);
}
return 0;
}
Piggy-Bank
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.
HDU 1114 Piggy-Bank(完全背包 DP),布布扣,bubuko.com
HDU 1114 Piggy-Bank(完全背包 DP)
标签：acm hdu 动态规划 完全背包
原文地址：http://blog.csdn.net/iooden/article/details/38585647
