zoukankan      html  css  js  c++  java
  • 【01背包】HDU 1171 Big Event in HDU

    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
    

    Author

    lcy
     
    思路是先算出总价值,然后除以二,所以A和B一定是最接近value/2的一左一右两个数,用dp[value/2]去做就是B,A=value-B
     
     1 #include <iostream>
     2 #include<cstdio>
     3 #include<algorithm>
     4 #include<cstring>
     5 #include<cmath>
     6 using namespace std;
     7 
     8 int a[5005];
     9 int dp[250005];
    10 
    11 int main()
    12 {
    13     int n,v,s,value,value1;
    14     while(~scanf("%d",&n)&&n>=0)
    15     {
    16         value=0;
    17         int j=0;
    18         for(int i=1;i<=n;i++)
    19         {
    20             scanf("%d%d",&v,&s);
    21             while(s--)
    22             {
    23                 a[j]=v;
    24                 j++;
    25                 value+=v;
    26             }
    27         }
    28         value1=value;
    29         value/=2;
    30         memset(dp,0,sizeof(dp));
    31         for(int i=0;i<j;i++)
    32         {
    33             for(int k=value;k>=a[i];k--)
    34             {
    35                 dp[k]=max(dp[k],dp[k-a[i]]+a[i]);
    36             }
    37         }
    38         printf("%d %d
    ",value1-dp[value],dp[value]);
    39     }
    40     return 0;
    41 }
     
  • 相关阅读:
    演练:创建和使用托管程序集 (C++)
    QT中各种MessageBox的使用
    QT使用打印机
    常用数据结构算法 c++模板实现
    创建可重用代码(C++)
    演练:创建和使用动态链接库 (C++)
    一些面试题,整理自网络,就不一一帖原址了
    《实践与思考》系列连载(4)——众说纷纭“架构师”
    XML Web Service并发异步调用的问题及其解决方案
    《实践与思考》书籍连载系列反馈区
  • 原文地址:https://www.cnblogs.com/Annetree/p/6058356.html
Copyright © 2011-2022 走看看