hdu 1171

题目链接：点击打开链接

题意：给出每种物品的价值和数量，将这些物品平分给A,B，使得A,B尽可能相等并保证A不小于B

思路1 ： 根据题意可得物品最多有100000件，数目不多，可以转化为01背包

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <string.h>
using namespace std;
const int maxn = 300005;
int dp[maxn] , v[maxn] ;

int main()
{
  //  freopen("a.txt" , "r" , stdin) ;
    int n , a , b ,number , sum;
    while(scanf("%d" , &n) != EOF && n > 0)
    {
        memset(v , 0 , sizeof(v)) ;
        number = 1 ; sum = 0 ;
        for(int i = 1 ; i <= n ; i ++)
        {
            scanf("%d%d" , &a , &b) ;
            sum += a*b ;
            while(b)
            {
              v[number++] = a ;
              b -- ;
            }
        }
       memset( dp , 0 , sizeof(dp)) ;
      // printf("%d %d\n" , number , sum);
       for(int i = 1 ; i < number ; i ++)
       {
           for(int j = sum/2 ; j >= v[i] ; j -- )
             dp[j] = max(dp[j] , dp[j-v[i]] + v[i]) ;
       }
       printf("%d %d\n" , sum - dp[sum/2] , dp[sum/2]) ;
    }
    return 0;
}

思路2 多重背包

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <string.h>
using namespace std;
const int maxn = 300005;
int dp[maxn] , v[1005] , m[1005];
int sum ;

void ZeroOnePack (int cost , int value)
{
    for(int i = sum ; i >= cost ; i -- )
        dp[i] = max(dp[i] , dp[i-cost] + value) ;
}

void CompletePack (int cost , int value)
{
    for(int i = cost ; i <= sum ; i ++)
        dp[i] = max(dp[i] , dp[i-cost] + value) ;
}

void MultiplePack (int cost , int value , int amount)
{
    if(cost * amount >= sum) CompletePack(cost , value) ;
    else
    {
        int k = 1 ;
        while(k < amount)
        {
            ZeroOnePack(k*cost , k*value) ;
            amount -= k ;
            k <<= 1 ;
        }
        ZeroOnePack(amount *cost , amount *value) ;
    }
}

int main()
{
    //freopen("a.txt" , "r" , stdin) ;
    int n ;
    while(scanf("%d" ,&n) != EOF && n > 0)
    {
        sum = 0 ;
        memset(dp , 0 , sizeof(dp)) ;
        for(int i = 1 ; i <= n ; i ++)
        {
            scanf("%d%d" , &v[i] , &m[i]) ;
            sum += v[i]*m[i] ;
        }
        for(int i = 1 ; i <= n ; i ++)
            MultiplePack(v[i] , v[i] , m[i]) ;
        printf("%d %d\n" , sum - dp[sum/2] , dp[sum/2]) ;
    }

    return 0;
}