#USACO 12.07 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 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.

输入输出格式

输入格式：

• 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

输出格式：

• Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

输入输出样例

输入样例#1：

4 61 42 63 122 7

输出样例#1：

23压缩状态DP典型模板
#include<cstdio>#include<iostream>#include<cmath>#include<cstring>#include<algorithm>using namespace std;int main(){int f[20000],v,n,c[20000],w[20000];scanf("%d%d",&n,&v);for (int i=1;i<=n;i++)scanf("%d%d",&w[i],&c[i]);for (int i=1;i<=n;i++)for (int j=v;j>=w[i];j--)f[j]=max(f[j],f[j-w[i]]+c[i]);printf("%d",f[v]);return 0;}