• HDOJ_ACM_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
     
    Code
    View Code
     1 #include <stdio.h>
     2 #include <iostream>
     3 #define N 50 * 50 * 100
     4 int value[(N + 5) / 2];
     5 int f[(N + 5) / 2];
     6 int main()
     7 {
     8     int i, j, n, v, vn, sum, count;
     9     while (scanf("%d", &n) != EOF && n >= 0)
    10     {
    11         //input and get the count and sum
    12         count = 1;
    13         sum = 0;
    14         while (n--)
    15         {
    16             scanf("%d %d", &v, &vn);
    17             sum += v * vn;
    18             for (i = count; i < count + vn; i++)
    19                 value[i] = v;
    20             count += vn;
    21         }
    22         //initialize
    23         memset(f, 0, sizeof(f));
    24         //handle
    25         count--;
    26         for (i = 1; i <= count; i++)
    27         {
    28             for (j = sum / 2; j >= value[i]; j--)
    29             {
    30                 if (f[j] < f[j - value[i]] + value[i])
    31                     f[j] = f[j - value[i]] + value[i];
    32             }
    33             if (f[j] == sum / 2)
    34                 f[sum / 2] = f[j];
    35         }
    36         //print
    37         printf("%d %d\n", sum - f[sum / 2], f[sum / 2]);
    38     }
    39     return 0;
    40 }

    Key points

    Firstly, this is the question about multipe knapsack, but you can translate it to a knapsack question.

    Secondly, draw attention to the details, likes sum / 2 is interger.

     
  • 相关阅读:
    开源TinyXML 最简单的新手教程
    2014第14周一开发问题记
    2014第13周日
    140329
    2014第13周五
    2014第13周四Webservice概念问题记
    2014第13周三
    2014第13周二
    2014第13周一
    2014第12周日
  • 原文地址:https://www.cnblogs.com/chuanlong/p/2782179.html
Copyright © 2020-2023  润新知