【POJ3264】 Charm Bracelet
来源:互联网 发布:桌面日历记事本软件 编辑:程序博客网 时间:2024/06/01 09:26
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 theN (1 ≤ N ≤ 3,402) available charms. Each charm i in 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.
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
#include <cstring>
#include <stdio.h>#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
#include <queue>
using namespace std;
int N,M;
int w[4000];
int v[4000];
int dp[4000][400];
int main()
{
while(scanf("%d%d",&N,&M) != EOF)
{
memset(dp,0,sizeof(dp));
memset(w,0,sizeof(w));
memset(v,0,sizeof(v));
for(int i=1;i<=N;i++)
{
scanf("%d%d",&w[i],&v[i]);
}
for(int i=1;i<=N;i++)
{
for(int j=M;j>=0;j--)
{
if(j >= w[i])
dp[i][j] = max(dp[i-1][j],dp[i-1][j-w[i]] + v[i]);
}
}
for(int i=0;i<=N;i++)
{
for(int j=0;j<=M;j++)
{
cout << dp[i][j] << " " ;
}
}
printf("%d\n",dp[N][M]);
}
return 0;
}
- 【POJ3264】 Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- poj 3624 Charm Bracelet
- poj3624 Charm Bracelet
- poj 3624 Charm Bracelet
- poj3624 Charm Bracelet
- poj 3624 Charm Bracelet
- 对程序员职业的一些建议
- 编译安卓源码的注意事项
- Perform Two Phase Commits
- 如何判断一个正整数数x是否为2的幂
- 最短路径问题
- 【POJ3264】 Charm Bracelet
- poj 3122 二分
- C++读书清单
- 安卓cpu调速器和IO策略
- 不要把自己定位的太高
- UML统一建模语言
- 快速排序C实现(阿里巴巴 2012年笔试题)
- python学习笔记 with语句
- 线段树练习 2(线段树是个啥玩意啊,还是个大师的题,我感觉青铜都不到)