HDU 1171 01背包变形
来源:互联网 发布:啊哈算法 epub 编辑:程序博客网 时间:2024/05/16 12:35
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43941 Accepted Submission(s): 15113
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一开始看这道题,既不是完全背包也不是01背包,以为要用到多重背包,看了看大佬的博客,才发现可以变成01背包来解决,只要把机器的价值分开来算就行了,就是时间不算短,等会了新的方法在更新吧。#include<stdio.h>#include<string.h>#include<algorithm>#include<iostream>using namespace std;int val[5050],dp[250050];int main(){int n;while(scanf("%d",&n) && n>0){memset(dp,0,sizeof(dp));int a,b,num=0,sum=0;for(int i=1;i<=n;i++){scanf("%d%d",&a,&b);sum+=a*b; while(b--)val[num++]=a; } for(int i=0;i<num;i++){for(int j=sum/2;j>=val[i];j--)dp[j]=max(dp[j],dp[j-val[i]]+val[i]);}printf("%d %d\n",sum-dp[sum/2],dp[sum/2]);}}
阅读全文
0 0
- hdu 1171 01背包变形
- HDU 1171 01背包变形
- 01背包变形 HDU 2660
- 01背包变形 HDU 3496
- HDU 3466 01背包变形
- hdu 2955(01背包变形)
- hdu 1171 Big Event in HDU(01背包变形)
- HDU 1171 母函数或者01背包变形
- hdu 2955 01 背包小变形
- hdu 2955 Robberies 01背包变形
- hdu 2955 Robberies(01背包变形)
- hdu 4104 Discount 01背包变形+优化
- hdu 2546 饭卡(01背包变形)
- HDU 2955 Robberies 变形01背包
- HDU 2546--饭卡【01背包变形】
- HDU 3466--Proud Merchants【01背包变形】
- HDU 2955 Robberies(01背包变形)
- HDU 1574 RP问题(01背包变形)
- C++ string详解
- POJ—3264(Balanced Lineup)
- 大数据协作框架简介
- 页面传入json数组参数的处理代码
- Java stack 类
- HDU 1171 01背包变形
- 游戏服务器架构探讨
- python tensorflow的安装
- Django URL传参 FORM表单传数据 get post用法示例
- C++ 两个高精度数相乘
- 习题5-3 卡片游戏(Throwing cards away I, UVa 10935)
- 九度oj 1437 To Fill or Not to Fill
- 浅谈android MVVM 让你的代码更简洁
- 简单模仿qq登录界面