解题思路:
注意事项:
参考代码:
import java.util.Scanner; public class 背包问题{ public static void main(String[] arg){ Scanner scanner=new Scanner(System.in); int[] w=new int [202]; int[] c=new int [202]; int[][] arr=new int [202][202] ; int m=scanner.nextInt(); int n=scanner.nextInt(); for (int i = 1; i <=n; i++) { w[i]=scanner.nextInt(); c[i]=scanner.nextInt(); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (w[i]>j) { arr[i][j]=arr[i-1][j]; } else { arr[i][j]=Math.max(arr[i-1][j], c[i]+arr[i-1][j-w[i]]); } } } System.out.println(arr[n][m]); } }
0.0分
1 人评分