完全背包解决方案

解题思路:

注意事项:

参考代码:

import java.util.Scanner;

public class a7 {

/**

* @param args

*/

public static void main(String[] args) {

// TODO Auto-generated method stub

Scanner scanner =new Scanner(System.in);

int a=scanner.nextInt(),b=scanner.nextInt();

int dp[][]=new int[b+1][a+1];

int p[]= new int[b+1];

int v[]=new int[b+1];

for (int i = 1; i <=b; i++) {

v[i]=scanner.nextInt();

p[i]=scanner.nextInt();

}

for (int i = 1; i <=b; i++) {

for (int j = 1; j <=a; j++) {

if (j>=v[i]) {

dp[i][j]=Math.max(dp[i-1][j], dp[i][j-v[i]]+p[i]);//重点

}

else{

dp[i][j]=dp[i-1][j];

}

}

}

System.out.println("max="+dp[b][a]);

}

}