POJ 3624 Charm Bracelet (01背包)

最新推荐文章于 2021-02-27 19:37:41 发布

tiutiu2011

最新推荐文章于 2021-02-27 19:37:41 发布

阅读量454

点赞数

分类专栏： ACM-ICPC Talk is cheap Show me the code 文章标签： POJ 3624 Charm Bracelet 01背包动态规划

本文链接：https://blog.csdn.net/tiutiu2011/article/details/49079083

版权

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章 0 订阅

订阅专栏

ACM-ICPC

154 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define MAX_CHARMS 3402
#define MAX_WEIGHT 12880

typedef struct Charm{
	int weight;
	int desirability;
}Charm;
Charm CharmArray[MAX_CHARMS + 1];
int numOfCharms;
int weightLimit;
//maxDesirability[preCharms][totalWeight],内存会超限
int maxDesirability[MAX_CHARMS + 1][MAX_WEIGHT + 1];

int main(){

	scanf("%d%d", &numOfCharms, &weightLimit);
	int charm;
	for (charm = 1; charm <= numOfCharms; charm++)
		scanf("%d%d", &CharmArray[charm].weight, &CharmArray[charm].desirability);

	int preCharms;
	int totalWeight;
	for (preCharms = 1; preCharms <= numOfCharms; preCharms++)
		for (totalWeight = 1; totalWeight <= weightLimit; totalWeight++)
			if (CharmArray[preCharms].weight > totalWeight)
				maxDesirability[preCharms][totalWeight] = maxDesirability[preCharms - 1][totalWeight];
			else {
				int tempWeight = maxDesirability[preCharms - 1][totalWeight - CharmArray[preCharms].weight] + CharmArray[preCharms].desirability;
				if (tempWeight > maxDesirability[preCharms][totalWeight])
					maxDesirability[preCharms][totalWeight] = tempWeight;
			}
		
	printf("%d\n", maxDesirability[numOfCharms][weightLimit]);

	return 0;
}