hdu1171 完全背包两种解法多重背包

最新推荐文章于 2022-03-17 16:24:18 发布

向往蓝天的鱼

最新推荐文章于 2022-03-17 16:24:18 发布

阅读量665

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/zhangjing11292/article/details/22815071

版权

动态规划专栏收录该内容

67 篇文章 2 订阅

订阅专栏

Big Event in HDU

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21202 Accepted Submission(s): 7460

Problem Description

Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002.
The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).

Input

Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different.
A test case starting with a negative integer terminates input and this test case is not to be processed.

Output

For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.

Sample Input

Sample Output

很明显完全背包容量为总的一半

数组要开大不然运行错误

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[500005],w[1005],num[1005];
int main()
{
	int n,m;
	while(cin>>n&&n>=0)
	{
		memset(dp,0,sizeof(dp));
		int i,j,v_sum=0,k;
		for(i=1;i<=n;++i)
		{
			cin>>w[i]>>num[i];
			v_sum+=w[i]*num[i];
		}
		m=v_sum/2;
		for(i=1;i<=n;++i)
		{
			for(k=1;k<=num[i];++k)
			{
				for(j=m;j>=w[i];--j)
				{
				
					dp[j]=max(dp[j-w[i]]+w[i],dp[j]); 
				}	
			}
		}
		cout<<v_sum-dp[m]<<" "<<dp[m]<<endl;		
	}
}

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[500005],w[1005];
int main()
{
	int n,m;
	while(cin>>n&&n>=0)
	{
		memset(dp,0,sizeof(dp));
		int i,j,a,v_sum=0;
		for(i=1;i<=n;++i)
		{
			cin>>w[i]>>a;
			v_sum+=w[i]*a;
		}
		m=v_sum/2;
		for(i=1;i<=n;++i)
		{
			for(j=w[i];j<=m;++j)
			{
				dp[j]=max(dp[j-w[i]]+w[i],dp[j]); 
			}		
		}
		cout<<v_sum-dp[m]<<" "<<dp[m]<<endl;		
	}
}

多重背包解法

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 350000
int dp[N],w[1000],v[1000];
int main()
{
	int n;
	while(cin>>n&&n>=0)
	{
		int i,j,k;
		memset(dp,0,sizeof(dp));
		int weight,value,number;
		int count=1,sum=0;;
		for(i=1;i<=n;++i)          
		{
			cin>>weight>>number;
			value=weight;
			sum+=weight*number;
			for(k=1;k<=number;k<<=1)
			{
				v[count]=k*value;
				w[count++]=k*weight;
				number-=k;
			}
			if(number>0)
			{
				v[count]=number*value;
				w[count++]=number*weight;
			}
		}
		for(i=1;i<=count-1;++i)
			for(j=sum/2;j>=w[i];--j)
				dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
        cout<<sum-dp[sum/2]<<" "<<dp[sum/2]<<endl;
	}
	return 0;
}

完全背包几乎不耗时但好空间对比如下：上边是完全背包解法