Piggy-Bank/HDU 1114/DP

最新推荐文章于 2024-10-01 18:52:56 发布

mmmd什么意思

最新推荐文章于 2024-10-01 18:52:56 发布

阅读量166

点赞数

文章标签：动态规划

本文链接：https://blog.csdn.net/weixin_45600829/article/details/103952770

版权

Piggy-Bank/HDU 1114/DP

题目

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!
题目来源：HDU 1114
题目链接

题意

有一存钱罐，存钱前重量是E，存后重量是F，有n种不同的硬币，面值为Pi，重量为Wi，硬币数量不限，问存钱罐中最小的硬币面值总和，若无法组成则输出This is impossible.

解法

完全背包，dp[j]表示重量为j时能合成的最小的面值，状态转移方程dp[j+w[i]]=min(dp[j+w[i]],dp[j]+p[i])。

代码：

#include <iostream>
#include <stdio.h>
#include <cstring>
#define smax 1000000000
using namespace std;
int dp[10010],v[510],w[510];
int n,a,b,V,T;
int main()
{
	scanf("%d",&T);
	while (T--) 
	{
		scanf("%d%d",&a,&b);
		V=b-a;
		for (int i=0;i<=V;i++) dp[i]=smax;
		scanf("%d",&n);
		for (int i=1;i<=n;i++) scanf("%d%d",&v[i],&w[i]);
		dp[0]=0;
		for (int i=1;i<=n;i++) 
		for (int j=0;j<=V;j++) 
		if (dp[j]!=smax && j+w[i]<=V && dp[j+w[i]]>dp[j]+v[i]) 
		{
			dp[j+w[i]]=dp[j]+v[i];
		} 
		if (dp[V]==smax) printf("This is impossible.\n");
		 else printf("The minimum amount of money in the piggy-bank is %d.\n",dp[V]);
	}
	return 0;
}