TOJ 1081 ZOJ 1149 HDU 1059 Dividing / 多重背包二进制优化

Dividing

时间限制(普通/Java):1000MS/10000MS     运行内存限制:65536KByte

描述

Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value. Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.

输入

Each line in the input file describes one collection of marbles to be divided. The lines contain six non-negative integers n1 , . . . , n6 , where ni is the number of marbles of value i. So, the example from above would be described by the input-line "1 0 1 2 0 0". The maximum total number of marbles will be 20000.
The last line of the input file will be "0 0 0 0 0 0"; do not process this line.

输出

For each collection, output "Collection #k:", where k is the number of the test case, and then either "Can be divided." or "Can't be divided.".
Output a blank line after each test case.

样例输入

1 0 1 2 0 0 
1 0 0 0 1 1 
0 0 0 0 0 0

样例输出

Collection #1:
Can't be divided.

Collection #2:
Can be divided.

要用到多重背包 把物品个数拆成1 2 4 8.....

不然会超时

数组可以开个bool类型的

#include<stdio.h>
#include<string.h>
int max(int x,int y)
{
	return x>y?x:y;
}
int DP(int sum,int *a)
{
	int i,j,dp[120010],k;
	memset(dp,0,sizeof(dp));
	for(i=1;i<=6;i++)
	{
		k = 1;
		while(k <= a[i-1])
		{
			for(j = sum;j >= k*i; j--)
				dp[j] = max(dp[j - k * i] + k * i, dp[j]);
			a[i - 1] -= k;
			k <<= 1;
		}
		k = a[i-1];
		for(j = sum;j >= k*i; j--)
			dp[j] = max(dp[j - i*k] + i * k , dp[j]);		
	}
	return dp[sum];
}
int main()
{
	int i,j,a[7],sum,t=1;
	while(scanf("%d %d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5]),a[0]||a[1]||a[2]||a[3]||a[4]||a[5])
	{
		printf("Collection #%d:\n",t++);
		sum = 0;
		for(i = 0;i < 6; i++)
			sum += (i + 1) * a[i];
		if(sum % 2)
			printf("Can't be divided.\n\n");
		else
		{
			sum /= 2;
			if(DP(sum,a) == sum)
				printf("Can be divided.\n\n");
			else
				printf("Can't be divided.\n\n");
		}
	}
	return 0;
}