HDU 1171
来源:互联网 发布:怎样用淘宝客推广 编辑:程序博客网 时间:2024/06/10 04:21
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28785 Accepted Submission(s): 10116
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 (0V<=50 –value of facility) and an integer M (0M<=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
第一次接触这种一维01背包的题
题目的关键在于以往的重量w[i]和价值v[i]在这里都是t[i]
转移方程为dp[j] = max(dp[j],dp[j - t[i]] + t[i]);
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>using namespace std;int t[5005];int dp[255555];int main(){ int n; while(scanf("%d",&n)&&n>0){ int i,j; int a,b; int k = 0,sum = 0; for(j = 0;j<n;j++){ scanf("%d%d",&a,&b); for(i = 0;i<b;i++){ t[k] = a; sum += a; k++; } } memset(dp,0,sizeof(dp)); for(i = 0;i<k;i++) for(j = sum/2;j>=t[i];j--) dp[j] = max(dp[j],dp[j-t[i]] + t[i]); printf("%d %d\n",sum - dp[sum/2],dp[sum/2]); }; return 0;}
- HDU 1171 ?
- hdu 1171
- hdu 1171
- hdu 1171
- hdu 1171
- hdu 1171
- HDU 1171
- hdu 1171
- hdu 1171
- HDU 1171
- hdu 1171
- hdu 1171
- HDU 1171
- HDU 1171
- HDU 1171
- hdu 1171
- hdu 1171
- HDU 1171
- hdu 3342 Legal or Not(拓扑)
- UVA 439 Knight Moves
- Photoshop 的窗口和视图
- 多表连接
- 微信JSSDK分享接口中wx.config 出现invalid signature问题的解决办法
- HDU 1171
- POJ3258—River Hopscotch—二分法求the largest mimmun
- Qt实战之开发CSDN下载助手 (3)(结束篇)
- SSH开发——菜鸟那些事儿
- zoj 3882 Help Bob(博弈)
- 循环、数组截取、随机数的产生(2015/7/30)
- STL学习记录(十四):其它几种算法
- VS2010关于error LNK1123: 转换到 COFF 期间失败: 文件无效或损坏
- ARM处理器体系架构详细说明