TOJ 3479 Four Gate Push /完全背包

Four Gate Push

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

描述

You are working hard on your Protoss builds in StarCraft II, especially the 4 Gate Push. You've come upon a tough problem, however, which is how to determine the distribution of zealots, stalkers, and sentries to maximize your army strength. Recall (although you should already know!) that zealots cost 100 minerals and no gas, stalkers cost 125 minerals and 50 gas, and sentries cost 50 minerals and 100 gas. Given your current economy and how much each unit increases your army strength, determine the maximum army strength you can obtain.

输入

The input consists of multiple test cases, one on each line. Each test case has 5 integers M (0 <= M <= 50, 000),
the amount of minerals you have, G (0 <=G <=50, 000), the amount of gas you have, Z (0 <= Z <= 1, 000),
the strength of a zealot in your army, S (0 <=S <=1, 000), the strength of a stalker in your army, and E(0 <=E <=1, 000), the strength of a sentry in your army. Input is followed by a single line with M = G =Z = S = E = 0, which should not be processed.

输出

For each case, output a single line containing the maximum army strength you can obtain.

样例输入

500 400 10 20 15
0 0 0 0 0

样例输出

95

等价于有2个背包体积的完全背包 不过 那个 i的循环放最外面这么就错了 ？？？ 求解

#include <stdio.h>
#include <string>
#define MAX 2010
int dp[MAX][MAX];
main()
{
	int map[4][2] = {{4,0},{5,1},{2,2}};
	int i,j,k,m,g;
	int a[3];
	while(scanf("%d %d %d %d %d",&m,&g,&a[0],&a[1],&a[2]),m||g||a[0]||a[1]||a[2])
	{
		memset(dp,0,sizeof(dp));
		m /= 25;
		g /= 50;
		for(j = 1; j <= m; j++)
		{
			for(k = 1; k <= g; k++)
			{
				for(i = 0;i < 3; i++)
				{
					if(j >= map[i][0] && k >= map[i][1])
					{
						if(dp[j][k] < dp[j-map[i][0]][k-map[i][1]] + a[i])
						{
							dp[j][k] = dp[j-map[i][0]][k-map[i][1]] + a[i];
						}
					}
				}
			}
		}
		printf("%d\n",dp[m][g]);
	}
}