HDU 1171 Big Event in HDU (多重背包变形)
2015-07-12 23:01
411 查看
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27961 Accepted Submission(s): 9847
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
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1171
题目大意:有n种物品,价值为vi的有mi个,现在要买两份,要求第一份物品总价值大于等于第二份,且两份物品总价值的差最小
题目分析:多重背包问题,递减枚举价值,一旦当前价值超过了总价值的一半,计算差值取最小
#include <cstdio> int m[55], v[55]; int main() { int n; while(scanf("%d", &n) != EOF && n > 0) { int sum = 0; for(int i = 0; i < n; i++) { scanf("%d %d", &v[i], &m[i]); sum += v[i] * m[i]; } int mi = sum, ans = v[0]; for(int i = 0; i < n; i++) for(int j = sum; j >= v[i]; j--) for(int k = 0; k <= m[i]; k++) if(j >= k * v[i]) if(k && j % (k * v[i]) == 0 && j * 2 >= sum && 2 * j - sum < mi) { mi = 2 * j - sum; ans = j; } printf("%d %d\n", ans, sum - ans); } }
相关文章推荐
- 关于CDialog::DoModal
- 交叉引用的解决方法——类声明的应用
- HT for Web列表和3D拓扑组件的拖拽应用
- Xcode histogram图像显示测试
- OLAP 支持---ROLLUP和CUBE语句 group by 的增强版本语句!可进行分层分组模式外 (小计与总计)
- android入门学习-UML(统一建模语言)介绍
- SQL Server ->> 分区表上创建唯一分区索引
- Section 1.3
- 适配器模式Adapter、外观模式Facade-- 学习HeadFirst设计模式记录
- Lowest Common Ancestor of a Binary Search Tree
- 对比iOS中的四种数据存储
- 【PHP教程二】PHP基本知识,运行自己写的.php文件
- mysql必知必会(六)
- 优化Mysql数据库的8个方法
- Thread
- 实时获取UITextField内容
- gpio
- linux下mysql安装和安装遇到的问题
- python用for循环实现冒泡排序
- lightoj 1021 Painful Bases (状压dp)