HDOJ 1171 Big Event in HDU(多重背包)
来源:互联网 发布:linux redis 编辑:程序博客网 时间:2024/05/14 08:57
Big Event in HDU
Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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
同样是多重背包问题,和POJ的1014差不多。
#include<stdio.h>#include<string.h>#include<stdlib.h>#define N 300000int dp[N],k[N];int V,n;int w[N];int maxx(int a,int b){ if(a>b) { return a; } else { return b; }}void pack1(int p,int w){ int j; for(j=V;j>=p;j--) { dp[j] = maxx(dp[j],dp[j-p]+w); }}void pack2(int p,int w){ int j; for(j=p;j<=V;j++) { dp[j] = maxx(dp[j],dp[j-p]+w); }}void pack3(int p,int w,int k){ //printf("%d %d %d\n",p,w,k); //printf("V = %d\n",V); if(p*k>=V) { pack2(p,w); return ; } else { int kk= 1; while(kk<=k) { pack1(kk*p,kk*w); k = k - kk; kk = kk<<1; } pack1(k*p,k*w); }}int main(){ int i,j; while(scanf("%d",&n)!=EOF) { if(n <0) { break; } V = 0; memset(w,0,sizeof(w)); memset(k,0,sizeof(k)); for(i=1;i<=n;i++) { scanf("%d%d",&w[i],&k[i]); V = V + w[i] * k[i]; } int VV; VV = V; V = V/2; memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++) { pack3(w[i],w[i],k[i]); } if(dp[V]>VV-dp[V]) { printf("%d %d\n",dp[V],VV-dp[V]); } else { printf("%d %d\n",VV-dp[V],dp[V]); } } return 0;}
0 0
- HDOJ题目1171Big Event in HDU(多重背包)
- HDOJ 1171 Big Event in HDU(多重背包)
- HDOJ Big Event in HDU 多重背包
- HDOJ 1171 Big Event in HDU (多重背包) / (母函数)
- Big Event in HDU (多重背包)
- hdoj 1171 Big Event in HDU(母函数/多重背包)
- HDU 1171 Big Event in HDU(多重背包)
- hdu 1171 Big Event in HDU(多重背包)
- HDU 1171 Big Event in HDU (多重背包)
- hdu 1171 Big Event in HDU(多重背包)
- HDU 1171 Big Event in HDU(多重背包)
- HDU 1171 Big Event in HDU(多重背包)
- HDU 1171 Big Event in HDU(多重背包)
- HDU 1171 Big Event in HDU (多重背包)
- HDU 1171 Big Event in HDU(多重背包)
- HDU 1171 Big Event in HDU(多重背包)
- HDU 1171 Big Event in HDU(多重背包)
- HDU 1171 Big Event in HDU(多重背包)
- linux上编译mongodb c++ 客户端sdk
- Qt Model/View 学习笔记 (四)
- UVa10803_Thunder Mountain(最短路)(小白书图论专题)
- 单向链表的操作
- 实例学习gcc+gdb+make
- HDOJ 1171 Big Event in HDU(多重背包)
- HDU 1203 I NEED A OFFER!(01背包)
- Qt Model/View 学习笔记 (五)
- Web 服务器错误代码大全(转)
- POJ 1203 I NEED A OFFER!(01背包)
- POJ 2112 Optimal Milking (二分 + floyd + 网络流)
- 改变世界的17个等式
- 解决android4.0系统中菜单(Menu)添加Icon无效问题
- 空指针