分配口罩(动态规划,01背包)
题目大意
解题思路
属于动态规划类型的题目:即(有限制的最优选择问题)
我们设A医院分配为的口罩为high,设B医院分配为的口罩为low,
题目要求我们求 min(high - low),其中high = sum(所有口罩的总重量)- low:
所以原方程化简为:
min(sum - 2* low) = min 2*(sum/2 - low) , 即求max(low)
所以题目等价为:从15批口罩中选,总价值不超过 sum/2的最大值。
即求:dp[15] [sum/2]
所以我们默写01背包的java代码:
public class Main2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(new BufferedInputStream(System.in) );
int[] arr = {0,9090400,8499400,5926800,8547000,4958200,
4422600,5751200,4175600,6309600,5865200,
6604400,4635000,10663400,8087200,4554000};
int sum = 0;
for (int i = 0; i < arr.length; i++) {
sum += arr[i];
}
System.out.println(sum);
int[][] dp = new int[16][(sum/2)+1];
dp[0][0] = 0;
for (int i = 1; i <= 15; i++) {
for (int j = 0; j <=sum/2; j++) {
if(j-arr[i]>=0)
dp[i][j] = Math.max(dp[i-1][j],dp[i-1][(j-arr[i])]+arr[i]);
else
dp[i-1][j] = dp[i-1][j];
}
}
System.out.println(dp[sum/2]);
System.out.println(sum-2*dp[sum/2]);
}
}
但是此程序造成溢出,数据太大,因此我们将dp数组变为一维:
dp[i][j] = Math.max(dp[i-1][j],dp[i-1][(j-arr[i])]+arr[i]);
dp[j] = Math.max(dp[j] ,dp[j-arr[i]] +arr[i]);
//j要改成逆序,如果正序的话,dp[j-arr[i]]已经跟新了,dp[j]需要用的是没更新的dp[j-arr[i]]
完整代码如下:
完整代码
package 蓝桥杯环境;
import java.io.BufferedInputStream;
import java.util.Scanner;
public class Main2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(new BufferedInputStream(System.in) );
int[] arr = {0,9090400,8499400,5926800,8547000,4958200,
4422600,5751200,4175600,6309600,5865200,
6604400,4635000,10663400,8087200,4554000};
int sum = 0;
for (int i = 0; i < arr.length; i++) {
sum += arr[i];
}
System.out.println(sum);
int[] dp = new int[(sum/2)+1];
dp[0] = 0;
for (int i = 1; i <= 15; i++) {
for (int j = sum/2; j >=arr[i]; j--) {
dp[j] = Math.max(dp[j],dp[(j-arr[i])]+arr[i]);
}
}
System.out.println(dp[sum/2]);
System.out.println(sum-2*dp[sum/2]);
}
}
结果:2400