【洛谷】P1616 疯狂的采药

最新推荐文章于 2024-05-20 20:08:58 发布

Yudiannann

最新推荐文章于 2024-05-20 20:08:58 发布

阅读量108

点赞数 1

分类专栏：洛谷文章标签：算法

本文链接：https://blog.csdn.net/Yudiannann/article/details/137542735

版权

洛谷专栏收录该内容

8 篇文章 0 订阅

订阅专栏

import java.util.Scanner;

public class P1616_疯狂的采药 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sumWeight = sc.nextInt();
        int n = sc.nextInt();
        int[] weights = new int[n + 1];
        int[] values = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            weights[i] = sc.nextInt();
            values[i] = sc.nextInt();
        }

        int[][] dp = new int[n + 1][sumWeight + 1];
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= sumWeight; j++) {
                if (j >= weights[i]) {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - weights[i]] + values[i]);
                } else {
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }
        System.out.println(dp[n][sumWeight]);
    }
}

一开始用int的dp，但是通过不了最后一个用例，所以把dp换成long，结果MLE

------->需要降维

降维，同时dp为long

import java.util.Scanner;

public class P1616_疯狂的采药 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sumWeight = sc.nextInt();
        int n = sc.nextInt();
        int[] weights = new int[n + 1];
        int[] values = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            weights[i] = sc.nextInt();
            values[i] = sc.nextInt();
        }
        // 降维
        long[]dp = new long[sumWeight + 1];
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <=sumWeight; j++) {
                if (j >= weights[i]) {
                    dp[j] = Math.max(dp[j], dp[j - weights[i]] + values[i]);
                }
            }
        }
        System.out.println(dp[sumWeight]);
    }
}