算法3:动态规划(二)——背包问题
2017-01-19 15:16
471 查看
写在前面:本文记录一些背包问题(动态规划)的练习题,欢迎讨论!本系列系本人原创,如需转载或引用,请注明原作者及文章出处。本文持续更新。
一、Piggy Bank (POJ1384) 【恰好装满的完全背包问题】
描述
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!
输入
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.
输出
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.".
样例输入
样例输出
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.
代码
一、Piggy Bank (POJ1384) 【恰好装满的完全背包问题】
描述
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!
输入
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.
输出
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.".
样例输入
3 10 110 2 1 1 30 50 10 110 2 1 1 50 30 1 6 2 10 3 20 4
样例输出
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.
代码
#include<iostream> #include<algorithm> using namespace std; int T, e, f, totalv, n, v[510], w[510], opt[10010]; int main() { cin >> T; for (int t = 0; t < T; t++) { cin >> e >> f; totalv = f - e; cin >> n; for (int i = 1; i <= n; i++) cin >> v[i] >> w[i]; opt[0] = 0; for (int i = 1; i <= totalv; i++) opt[i] = 999999; for (int i = 1; i <= n; i++) { for (int j = w[i]; j <= totalv; j++) { opt[j] = min(opt[j], opt[j - w[i]] + v[i]); } } if (opt[totalv] == 999999) cout << "This is impossible." << endl; else cout << "The minimum amount of money in the piggy-bank is " << opt[totalv] << "." << endl; } return 0; }
相关文章推荐
- python 版 动态规划 背包问题算法
- 算法导论--动态规划(0-1背包问题)
- 算法导论16.2-2--动态规划(0-1背包问题)
- 算法导论16.2-2--动态规划(0-1背包问题)
- 算法-动态规划=背包问题
- 常考经典算法---动态规划(拼凑面额、背包问题)
- 算法导论16.2-2--动态规划(0-1背包问题)
- 算法导论16.2-2--动态规划(0-1背包问题)
- 【算法设计与分析】7、0/1背包问题,动态规划
- 实际问题的算法抽象——动态规划中的01背包问题
- [算法]动态规划之背包问题
- 算法导论16.2-2--动态规划(0-1背包问题)
- 简单0-1背包问题(算法类别:动态规划)
- 【算法数据结构Java实现】Java实现动态规划(背包问题)
- 0019算法笔记——【动态规划】0-1背包问题
- 夕拾算法进阶篇:18)装箱问题 (01背包_动态规划DP)
- 算法导论16.2-2--动态规划(0-1背包问题)
- 算法导论16.2-2--动态规划(0-1背包问题)
- 十大算法之一动态规划—解背包问题-C#代码
- 【算法系列-5】动态规划-背包问题