0-1背包问题

最新推荐文章于 2023-01-20 07:00:00 发布

OddBillow

最新推荐文章于 2023-01-20 07:00:00 发布

阅读量123

点赞数

分类专栏： code

本文链接：https://blog.csdn.net/quitozang/article/details/81772684

版权

code 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

import java.util.Scanner;

/**
 * Created by Tao on 2018/8/12.
 */
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] str1 = sc.nextLine().split(",");
        String[] str2 = sc.nextLine().split(",");
        int[] value = new int[str1.length];
        int[] volumn = new int[str1.length];
        for (int i = 0; i < str1.length; i++) {
            value[i] = Integer.valueOf(str1[i]);
            volumn[i] = Integer.valueOf(str2[i]);
        }
        int maxVolumn = sc.nextInt();

        int[][] V = new int[value.length+1][maxVolumn + 1];
        for (int i = 1; i <= value.length; i++) {
            for (int j = 1; j <= maxVolumn; j++) {
                if (volumn[i - 1] <= j) {
                    if (V[i - 1][j] < (V[i - 1][j - volumn[i - 1]] + value[i - 1]))
                        V[i][j] = V[i - 1][j - volumn[i - 1]] + value[i - 1];
                    else
                        V[i][j] = V[i - 1][j];
                } else
                    V[i][j] = V[i - 1][j];
            }
        }

        System.out.println(V[V.length-1][V[0].length-1]);

    }
}