zoukankan      html  css  js  c++  java
  • Big Event in HDU HDU1171 (多重背包)

    Big Event in HDU

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 41952    Accepted Submission(s): 14422


    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
     
    平分,使的最公平。前大于等于后。转化为01背包做。
     1 #include <iostream>
     2 #include <stdio.h>
     3 #include <string.h>
     4 using namespace std;
     5 int v[5500];
     6 int dp[250100];
     7 int main(){
     8     int n;
     9     while(scanf("%d",&n)&&n>0){
    10         int sum = 0,a,b,k=0;
    11         memset(dp,0,sizeof(dp));
    12         memset(v,0,sizeof(v));
    13         for(int i = 0; i < n; i ++){
    14             scanf("%d %d",&a,&b);
    15             sum += a*b;
    16             while(b--)v[k++]=a;
    17         }
    18         for(int i = 0; i < k; i ++){
    19             for(int j = sum/2; j >= v[i]; j --){
    20                 dp[j] = max(dp[j],dp[j-v[i]]+v[i]);
    21             }
    22         }
    23         printf("%d %d
    ",sum-dp[sum/2],dp[sum/2]);
    24     }
    25     return 0;
    26 }
  • 相关阅读:
    hdu 2602 Bone Collector 01背包
    总结
    类--接口 抽象父类 多态 鸭子类型 格式化方法与析构方法 反射 异常处理 自定义异常 断言
    类--组合 继承 super关键字 面向对象的三大性
    面向对象 名称空间 类与对象
    re正则模块 垃圾回收机制
    常用模块--hashlib hmac:加密 xml xlrd xlwt:excel读|写 configparser subprocess
    常用模块-- random shutil shevle logging sys.stdin/out/err
    常用模块-- time os sys 递归 序列化

  • 原文地址:https://www.cnblogs.com/xingkongyihao/p/7193389.html
Copyright © 2011-2022 走看看