POJ 3624 Charm Bracelet (01背包 + 内存优化)

最新推荐文章于 2020-06-10 15:48:24 发布

tiutiu2011

最新推荐文章于 2020-06-10 15:48:24 发布

阅读量444

点赞数 1

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

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

版权

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
#define MAX(x, y) ( (x) > (y) ? (x) : (y) )

int weight[MAX_CHARMS + 1];
int desirability[MAX_CHARMS + 1];
int numOfCharms;
int weightLimit;
//要写成优化内存版本，不然会内存超限
int maxDesirability[MAX_WEIGHT + 1];

int main(){

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

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