HDU 1171 解题报告

题目描述

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

题意：50种东西重量从1~50，分别最多有100个，两个人平分（要差距最小），分别能分多少；

思路：看了别人的解题报告，怎么都是01背包问题，个人认为是多重背包问题（每件物品有个数限制），可以转化成01背包。

源码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[2500005],v[5005];
int main()
{
    int n,i,j,sum,a,b;
    while(cin>>n,n>=0)
    {
            sum=0;
            int l=0;
            memset(v,0,sizeof(v));
        for(i=0;i<n;i++)
            {
                cin>>a>>b;
                while(b--)
                 {
                      v[l++]=a;
                      sum=sum+a;
                 }
            }
            memset(dp,0,sizeof dp);
            for(i=0;i<l;i++)
                for(j=sum/2;j>=v[i];j--)
            {
                dp[j]=max(dp[j],dp[j-v[i]]+v[i]);
            }
            cout<<sum-dp[sum/2]<<" "<<dp[sum/2]<<endl;
    }

    return 0;
}