poj-3624-Charm Bracelet【经典01背包】
来源:互联网 发布:税务数据采集软件 编辑:程序博客网 时间:2024/04/29 19:39
题目链接:点击打开链接
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
大意:基础背包问题,大概意思是,承重 m 的背包,有 n 个物品,第 i 个物品重 w [ i ],价值 val [ i ],求背包能装入物品的最大价值
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;int n,m;int w[5000],val[5000];int dp[13000];int main(){while(~scanf("%d%d",&n,&m)){for(int i=1;i<=n;i++){scanf("%d%d",&w[i],&val[i]);}memset(dp,0,sizeof(dp));for(int i=1;i<=n;i++){for(int j=m;j>=w[i];j--){dp[j]=max(dp[j],dp[j-w[i]]+val[i]);}}printf("%d\n",dp[m]);}return 0; }
- poj-3624-Charm Bracelet【经典01背包】
- POJ 3624 Charm Bracelet(经典的01背包问题)
- poj 3624 Charm Bracelet 01背包
- poj 3624 : Charm Bracelet (01背包)
- poj 3624 Charm Bracelet DP 01背包
- poj 3624Charm Bracelet(简单01背包)
- POJ 3624 Charm Bracelet 【DP】【01背包】
- POJ 3624 Charm Bracelet (01背包)
- Poj 3624 Charm Bracelet (01背包)
- poj 3624 Charm Bracelet 01背包
- poj 3624 Charm Bracelet 基础01背包
- poj 3624 Charm Bracelet 01背包问题
- [01背包]POJ 3624Charm Bracelet
- POJ 3624 Charm Bracelet(01背包)
- poj 3624 Charm Bracelet(01背包)
- POJ 3624 Charm Bracelet 01背包
- POJ 3624 Charm Bracelet 01背包问题
- POJ 3624 Charm Bracelet【01背包】
- php中的数组遍历
- CodeForces 356A Knight Tournament 【线段树】
- 你知道Hello World程序的由来吗?
- 方法的使用常见问题
- 增删改查
- poj-3624-Charm Bracelet【经典01背包】
- php中的作用域
- Java老鸟项目经验
- CSS颜色混合模式
- google map的简单应用-显示华南理工大学
- 有用的博客
- Day03 数组、类和对象
- mysql中的基本操作流程
- BZOJ 2724 [Violet 6]蒲公英