Big Event in HDU（背包，母函数）（F-6)

最新推荐文章于 2021-01-15 16:19:09 发布

新人小程序猿

最新推荐文章于 2021-01-15 16:19:09 发布

阅读量107

点赞数

分类专栏： Gemini's Trial

本文链接：https://blog.csdn.net/weixin_43697280/article/details/86701176

版权

Gemini's Trial 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Big Event in HDU

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

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

题目简述：
就是给出n样东西的价值和数量，要求怎么分配可以使得A和B得到的价值接近相等，且在无法相等的情况下，A要比B多。
分析sample input与output的例子：
第一个例子给出：
第一行2表示有两类物品，第二行第一个数字是第一类物品的价值，第二个数字是这类物品的数量，第三行是第二类物品，依此类推。
注意，输入n为负数是停止程序而不是输入-1停止程序
看得出这是背包问题：
01背包代码：

#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<climits>
#include<cmath>
using namespace std;
int dp[300000], v[5005];
int main()
{
	int n;
	while (~scanf_s("%d", &n)!=EOF && n>0)
	{
		int l, sum, a, b;
		l = 0;sum = 0;
		memset(dp, 0, sizeof(dp));
		memset(v, 0, sizeof(v));
		for (int i = 0;i < n;i++)
		{
			scanf_s("%d%d", &a, &b);
			while (b--)
			{
				v[l++] = a;
				sum += a;
			}
		}
		for (int i = 0;i < l;i++)
		{
			for (int j = sum / 2;j >= v[i];j--)
			{
				dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
			}
		}
		printf("%d %d\n", sum - dp[sum / 2], dp[sum / 2]);
	}
}