首页 > 专题系列 > Java解POJ > POJ 3624 Charm Bracelet [解题报告] Java
2013
11-12

POJ 3624 Charm Bracelet [解题报告] Java

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

样例输入:

4 6
1 4
2 6
3 12
2 7

样例输出:

23

解题代码:

//* @author: [email protected]
import java.io.*;
public class Main
{
 static int[] p,q,d;
 static int a,b;
 public static void main(String[] args) throws IOException
 {
	InputStreamReader is=new InputStreamReader(System.in);
	BufferedReader in=new BufferedReader(is);
	String[] ss=in.readLine().split(" ");
	a=Integer.parseInt(ss[0]);
	b=Integer.parseInt(ss[1]);
	p=new int[a+1];
	q=new int[a+1];
	for(int i=1;i<=a;i++)
	{
         ss=in.readLine().split(" ");
	  p[i]=Integer.parseInt(ss[0]);
	  q[i]=Integer.parseInt(ss[1]);
	}
	d=new int[b+1];
	for(int i=1;i<=a;i++)
		for(int j=b;j>=p[i];j--)
			d[j]=Math.max(d[j-p[i]]+q[i], d[j]);
	System.out.println(d[b]);
  }
}