poj 3624 Charm Bracelet
来源:互联网 发布:plc编程多久能入门 编辑:程序博客网 时间:2024/06/15 21:25
Description
Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight Wi (1 ≤ Wi ≤ 400), a 'desirability' factor Di (1 ≤ Di ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).
Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di
Output
* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
Sample Input
4 61 42 63 122 7
Sample Output
23
题目链接:http://poj.org/problem?id=3624
题目大意:有n只魔力手镯,已知每只手镯的重量和魔力值,求总重量不超过m的所有手镯的最大魔力总值。
解题思路:经典背包问题的简单题。dp[ v ]表示总重量在 v 以内的所有手镯的最大魔力总值。
方程为: dp[ v ] = dp [ v -w[ i ] ] + d [ i ] 写的时候用了结构,但用两个数组记录重量和价值就可以了。
代码如下:
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int dp[12890];//dp[i]表示在重量不超过i的情况下的最大价值struct A{ int w,d;//重量和价值}a[3410];int main(){ int i,j,n,m,ans=0;memset(dp,0,sizeof(dp)); scanf("%d%d",&n,&m); for(i=0;i<n;i++) scanf("%d%d",&a[i].w,&a[i].d);for(i=0;i<n;i++) //i从前往后,重量从大到小根据a[i]更新重量j以内的最大价值量for(j=m;j>=a[i].w;j--) // 第一次遍历,重量不小于a[0].w的dp值全更新为a[0].d的值,依次遍历不断更新。if(dp[j]<dp[j-a[i].w]+a[i].d) dp[j]=dp[j-a[i].w]+a[i].d;printf("%d\n",dp[m]); return 0;}
- poj 3624 Charm Bracelet
- poj 3624 Charm Bracelet
- poj 3624 Charm Bracelet
- poj 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- Poj 3624 Charm Bracelet
- poj 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- POJ-3624-Charm Bracelet
- POJ 3624 Charm Bracelet
- poj 3624 charm bracelet
- poj 3624:Charm Bracelet
- POJ--3624--Charm Bracelet
- poj 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- POJ-3624 Charm Bracelet
- 判断鼠标的点击区域
- liunx yum oracle11g 安装常用软件
- 游戏开发术语与常识
- java.util.concurrent介绍
- sgu205:Quantization Problem(dp)
- poj 3624 Charm Bracelet
- 北京工地洗轮机质量怎么样
- poj 2918 Tudoku 数独dfs
- hdu5000(dp)
- 数的长度
- LeetCode Longest Substring Without Repeating Characters
- Java学习笔记32
- 服务端开发问题汇集
- 【Python】Python数据结构