Coins/POJ 1742/DP

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

mmmd什么意思

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

阅读量116

点赞数

文章标签：动态规划

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

版权

Coins/POJ 1742/DP

题目

People in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn’t know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.
题目来源：POJ 1742
题目链接

题意

有n种不同的硬币，每种硬币面值为Ai，数量是Ci，它们组合的上限是m元，问他们能组合成多少种不同的价格。

解法

多重背包，设dp[j]表示能否组合成面值i,二维数组g[i][j]来表示合成面值j，用了多少枚硬币i，那么若dp[j]是真，则dp[j+a[i]]也为真，且g[i][j+a[i]]=g[i][j]+1,我们可以发现当进行循环时g[i][j]只会用到一次，所以我们可以直接将二维压缩为一维的，g[j]表示合成j，当前硬币i用了多少枚。

代码：

#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
int n,V,ans,a[110],b[110],g[100010];
bool dp[100010];

int main()
{
	scanf("%d%d",&n,&V);
	while(n!=0 && V!=0)
	{
		memset(dp,0,sizeof(dp));
		memset(g,0,sizeof(g));
		for (int i=1;i<=n;i++) scanf("%d",&a[i]);
		for (int i=1;i<=n;i++) scanf("%d",&b[i]);
		dp[0]=1;
		for (int i=1;i<=n;i++) 
		{
			for (int j=0;j<=V;j++) 
			{
				if (dp[j]&&j+a[i]<=V &&dp[j+a[i]]==0 && g[j]<b[i])
				{
					dp[j+a[i]]=1;
					g[j+a[i]]=g[j]+1;
				} 
				g[j]=0;
			}
		}
		ans=0;
		for (int i=1;i<=V;i++) if (dp[i]) ans++;
		printf("%d\n",ans);
		scanf("%d%d",&n,&V);
	}
	return 0;
}