HDU 1171 Big Event in HDU (多重背包)

Big Event in HDU

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


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
2
10 1
20 1
3
10 1 
20 2
30 1
-1
 Sample Output
20 10
40 40
之前由于题目描述还对相同价值的设施个数进行了归纳,也提交对了,看别人的才发现不用处理,思想和 邮票分你一半一题 一样
#include<algorithm>
#include<string.h>
#include<stdio.h>
using namespace std;
int p[55];
int c[55];
int dp[250050];
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		if(n<0) break;
		int sum=0;
		memset(dp,0,sizeof(dp));
		for(int i=0;i<n;i++)
		{
			scanf("%d%d",&c[i],&p[i]);
			sum+=p[i]*c[i];
		}
		
		for(int i=0;i<n;i++)
	    {
	        for(int j=1;j<=p[i];j++)//每个的最多数 
	        {
	            for(int k=sum/2;k>=c[i];k--)//01背包 
	            	if(dp[k]<dp[k-c[i]]+c[i])
	        	    	dp[k]=dp[k-c[i]]+c[i];
        	}
		}
		printf("%d %d\n",sum-dp[sum/2],dp[sum/2]);
	}
	return 0;
	
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/BBHHTT/article/details/79979147
个人分类: 动态规划
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭