8.2.1(2)完全背包问题
题目:在01背包的基础上,将每个物品的数目改成无限个。
普通解法1:在01背包的基础上加上一层for循环。
import java.util.*;
//背包
//dfs暴力
public class 草稿纸 {
public static void main(String[] args){
int N,V;
Scanner scanner = new Scanner(System.in);
N = scanner.nextInt();//物品数
V = scanner.nextInt();//背包容积
int[] v = new int[N+1];//每个物品的体积
int[] w = new int[N+1];//每个物品的价值
//给每个物品赋体积和价值
for (int i = 1; i <= N; i++) {
v[i] = scanner.nextInt();
w[i] = scanner.nextInt();
}
/**
* (完全背包)朴素解法:O^3
*/
int[][] dp = new int[N+1][V+1];
dp[0][0] = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= V; j++) {
int max = dp[i-1][j];
//dp[i][j]取所有肯中最大的那个
for (int k = 1; k*v[i] <= j; k++) {
if ((dp[i-1][j-k * v[i]]+k*w[i]) > max) {
max = dp[i-1][j-k * v[i]]+k*w[i];
}
}
dp[i][j] = max;
}
}
System.out.println(dp[N][V]);
}
}
优化解法2:O^2
/**
* (完全背包)优化解法
*/
int[][] dp = new int[N+1][V+1];
dp[0][0] = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= V; j++) {
if (j >= v[i]) {
dp[i][j] = Math.max(dp[i-1][j], dp[i][j-v[i]]+w[i]);
}else {
dp[i][j] = dp[i-1][j];
}
}
}
System.out.println(dp[N][V]);
注意:
//完全背包:
dp[i][j] = Math.max(dp[i-1][j], dp[i][j-v[i]]+w[i]);
//01背包 :
dp[i][j] = Math.max(dp[i-1][j], dp[i-1][j-v[i]]+w[i]);
//只有一丝丝的区别
优化解法3:数组变成一维。
/**
* (完全背包)一维数组优化解法
*/
int []dp = new int[V+1];
dp[0] = 0;
for (int i = 1; i <= N; i++) {
for (int j=v[i]; j <=V; j++) {
//dp[i][j]= Math.max(dp[i-1][j], dp[i][j-v[i]]+w[i]);
dp[j] = Math.max(dp[j], dp[j-v[i]]+w[i]);
}
}
System.out.println(dp[V]);
输入:
4 5
1 2
2 4
3 4
4 2输出:
优化前的dp算法:10