HDU1171
来源:互联网 发布:java政府驻场开发 编辑:程序博客网 时间:2024/05/17 05:13
1.题目叙述:
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38791 Accepted Submission(s): 13417
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).
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.
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
210 120 1310 1 20 230 1-1
Sample Output
20 1040 40
Author
lcy
Recommend
2.题目描述:
给出每个物体的价值和物体的数量,如何分使得A,B所得价值最接近并且A的价值不能小于B。
3.解题思路:
要使得价值最相近相当于有两个背包重量分别是sum / 2分别存sum - dp[sum / 2] 和dp[sum / 2]件物品的价值嘛,多重背包问题的话转换成二进制解决。
ps:然后这题还有一个解法是母函数,因为集训时候没学,以后学了补上orz
4.AC代码:
#include <stdio.h>#include <string.h>#include <algorithm>#define maxn 202000#define N 55using namespace std;int v[N], w[N], dp[maxn];int main(){int n;while (scanf("%d", &n) != EOF && n >= 0){memset(dp, 0, sizeof(dp));int sum = 0;for (int i = 0; i < n; i++){scanf("%d%d", &v[i], &w[i]);sum += v[i] * w[i];}for (int i = 0; i < n; i++)for (int j = 0; j < w[i]; j++)for (int k = sum / 2; k >= v[i]; k--)dp[k] = max(dp[k], dp[k - v[i]] + v[i]);printf("%d %d\n", sum - dp[sum / 2], dp[sum / 2]);} return 0;}
0 0
- hdu1171
- hdu1171
- HDU1171
- hdu1171
- HDU1171
- hdu1171
- HDU1171
- HDU1171
- hdu1171激动
- HDU1171 DP
- hdu1171多重背包
- hdu1171多重背包
- hdu1171(多重背包)
- hdu1171(多重背包)
- hdu1171多重背包
- hdu1171 多重背包
- hdu1171解题报告
- 【kmp】hdu1171 Number Sequence
- cura-engine学习(2)
- 大话C语言——分支优化
- Android通过WebService调用接口
- Linux shell编程之sed命令之二
- Eclipse+git中merge代码时出现conflict(冲突)的问题解决方案
- HDU1171
- urlMappings与URL映射
- 3.无乱码截取字符串
- Visual Studio中scanf的警告和sqrt()报错情况的处理方法
- 本机ip地址、localhost与127.0.0.1的区别
- IOS学习之NSMutableArray 的用法
- 深入浅出RxJava_06[传输过程的条件&组合操作]
- L1-009. N个数求和
- Unity3D Player角色移动控制脚本