简单背包问题——百炼01:Charm Bracelet
来源:互联网 发布:为什么淘宝没有金坷垃 编辑:程序博客网 时间:2024/05/14 10:31
点击打开链接http://bailian.openjudge.cn/2016acm/01/
01:Charm Bracelet
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 theN(1 ≤N≤ 3,402) available charms. Each charmiin the supplied list has a weightWi(1 ≤Wi≤ 400), a 'desirability' factorDi(1 ≤Di≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more thanM(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.
Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di
4 61 42 63 122 7
23
代码实现
#include <iostream>#include <cstdio>#include <queue>#include <vector>#include <map>using namespace std;const int maxn = 100000+5;int main(){ int n, m; int w[maxn], v[maxn]; int dp[maxn]; cin >> n >> m; for(int i=1; i<=n; i++) cin >> w[i] >> v[i]; for(int i=1; i<=n; i++) for(int j=m; j>=w[i]; j--) dp[j] = max(dp[j] , dp[j-w[i]]+v[i]); cout << dp[m] <<endl; return 0;}
1 0
- 简单背包问题——百炼01:Charm Bracelet
- poj 3624Charm Bracelet(简单01背包)
- charm bracelet 简单的01背包
- 百炼:4131:Charm Bracelet
- 【01背包】Charm Bracelet
- poj 3624 Charm Bracelet 01背包问题
- poj3624 Charm Bracelet DP 01背包问题
- POJ 3624 Charm Bracelet 01背包问题
- 01背包问题:poj 3624 Charm Bracelet
- POJ 3624Charm Bracelet (01背包问题)
- POJ3624 Charm Bracelet(01背包问题)
- POJ3624 Charm Bracelet(典型01背包问题)
- POJ3624 Charm Bracelet(01背包问题)
- Charm Bracelet —— 0-1背包
- 动态规划—北大POJ Charm Bracelet(01背包问题)
- 【hdu】 Charm Bracelet 01背包
- POJ3624:Charm Bracelet【01背包】
- Charm Bracelet poj 01 背包
- 【linux c】指针与数组的区别_学习笔记_012
- JAVA SE 面向对象笔记
- 数据库服务启动和关闭批处理命令
- Android 如何让EditText不自动获取焦点
- ASP.NET MVC 在控制器中接收视图表单POST过来的数据方法
- 简单背包问题——百炼01:Charm Bracelet
- coco数据集的处理
- 打包报错,编译无错
- 理论: STL(2): bitset
- HDU 5726 GCD
- html头文件中的 content = "IE=edge,chrome=1"
- win64 Python下安装PIL出错解决
- 嵌入式开发第10天(高级议题,C语言结束)
- 关于Oracle的事务