hdu 1171 Big Event in HDU DP
来源:互联网 发布:淘宝美人药妆激素 编辑:程序博客网 时间:2024/06/06 07:43
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25438 Accepted Submission(s): 8947
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
#include<iostream>#include<cstring>#include<algorithm>using namespace std;int dp[50*50*100/2+105];int main(){ int n; while(cin>>n && n>=0){ int i,j,sum=0,uu,vv; int v[5500],l=1; memset(v,0,sizeof v); for(i=1;i<=n;i++){ cin>>vv>>uu; sum+=vv*uu; while(uu--) v[l++]=vv; } int ans=sum; sum/=2; memset(dp,0,sizeof dp); for(i=1;i<l;i++) for(j=sum;j>=v[i];j--) dp[j]=max(dp[j],dp[j-v[i]]+v[i]); cout<<ans-dp[sum]<<" "<<dp[sum]<<endl; } return 0;}
0 0
- hdu 1171 Big Event in HDU DP
- hdu 1171 Big Event in HDU dp
- hdoj 1171Big Event in HDU【dp】
- HDU 1171 Big Event in HDU(dp)
- HDU 1171 Big Event in HDU(母函数||DP)
- hdu 1171 Big Event in HDU 费用可行性背包 dp
- hdu-1171Big Event in HDU(dp的应用)
- HDU 1171 Big Event in HDU(DP)
- HDU 1171 Big Event in HDU (DP--01背包)
- HDU 1171 Big Event in HDU dp背包
- 1171 Big Event in HDU
- hdu1171 Big Event in HDU(DP)
- hdoj 1171 Big Event in HDU(背包dp+母函数)
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- JS只能输入数字,数字和字母等的正则表达式
- 使用eclipse与Jlink调试S3C2440 2410
- android自定义控件之edittext
- get乱码用tomcat配置文件解决
- 利用SAE的Memcache缓存微信的access_token
- hdu 1171 Big Event in HDU DP
- SDUTOJ 2077 迷瘴 贪心
- selenium2webdriver对Wrapped元素的click()不起作用怎么办?
- 条件接收系统原理图
- Python中的文本处理
- DTS推出最新转码技术DTS:X
- (转载)Android数据库高手秘籍(四)——使用LitePal建立表关联
- CountDownLatch
- 提高查询效率对查询进行优化