hdu1171多重背包

来源：互联网发布：阿里云服务器优惠券编辑：程序博客网时间：2024/05/18 01:06

之前用01背包做，现在用多重背包再来一次http://blog.csdn.net/twenty_seven/article/details/42805157（01背包）

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int w[55];
int num[55];
int f[50*50*100/2+50];
int N;

#define max(a,b)(a>b?a:b)

int main()
{
while(~scanf("%d",&N)&&N>0)
{
  int i,j,k,sum1=0;
  memset(f,0,sizeof(f));
  for(i=1;i<=N;i++)
  {
   scanf("%d%d",&w[i],&num[i]);
   sum1+=w[i]*num[i];
  }
  int sum=sum1/2;
  for(i=1;i<=N;i++)
  {
   if(num[i]*w[i]>=sum)
   {
    for(j=w[i];j<=sum;j++)
     f[j]=max(f[j],f[j-w[i]]+w[i]);
   }
   else
   {
    int cnt=sum;
    k=1;
    while(k<=cnt)
    {
     for(j=sum;j>=k*w[i];j--)
      f[j]=max(f[j],f[j-k*w[i]]+k*w[i]);
     cnt-=k;
     k*=2;
    }
     for(j=sum;j>=cnt*w[i];j--)
      f[j]=max(f[j],f[j-cnt*w[i]]+cnt*w[i]);
   }
  }
  printf("%d %d\n",sum1-f[sum],f[sum]);
}
return 0;
}

0 0