zoukankan      html  css  js  c++  java
  • HDU 1171 Big Event in HDU

    Big Event in HDU

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

    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

    题意:

    将给出的物品的总价值分为A和B,A和B总价值相差最小,保证A>=B

    思路:

    动态转移方程  dp[j]=max(dp[j],dp[j-val[i]]+val[i])   dp[sum/2]表示B的最大价值

     1 #include <iostream>
     2 #include <string.h>
     3 using namespace std;
     4 
     5 int dp[300000];
     6 int val[5555];
     7 
     8 int main()
     9 {
    10     int n,num,sum;
    11     int a,b;
    12     while(cin>>n,n>0)
    13     {
    14         num=0;
    15         sum=0;
    16         while(n--){
    17             cin>>a>>b;
    18             while(b--){
    19                 val[num++]=a;
    20                 sum+=a;
    21             }
    22         }
    23         memset(dp,0,sizeof(dp));
    24         for(int i=0;i<num;i++){
    25             for(int j=sum/2;j>=val[i];j--){
    26                 dp[j]=max(dp[j],dp[j-val[i]]+val[i]);
    27             }
    28         }
    29         cout<<sum-dp[sum/2]<<" "<<dp[sum/2]<<endl;
    30     }
    31     return 0;
    32 }
  • 相关阅读:
    django的模型层
    django的模版
    SELinux入门基础
    CentOS 7.5上部署Zabbix 3.4
    使用orapki生成证书,配置Oracle数据使用SSL和TLS进行数据库连接的TCP/IP配置==TCPS
    keepalived + LVS实现高可用负载均衡集群
    Linux下LDAP用户认证,自动挂载网络共享文件系统
    编译安装Nginx,配置使用HTTPS
    RSyslog+MySQL+LogAnalyzer
    Bash Shell脚本--复制程序(命令)到指定目录下,同时将其所依赖的库文件复制到对应的目录
  • 原文地址:https://www.cnblogs.com/asuml/p/5593468.html
Copyright © 2011-2022 走看看