【洛谷】P1048 采药

import java.util.Scanner;

public class P1048_NOIP2005普及组_采药 {
    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 - 1][j - weights[i]] + values[i]);
                } else {
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }
        System.out.println(dp[n][sumWeight]);
    }
}

---

虽然能AC，但是如果需要更小的内存空间，则需要【降维】

import java.util.Scanner;

public class P1048_NOIP2005普及组_采药 {
    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 = sumWeight; j >=1; j--) { // 注意01背包要从大到小，完全背包则不用
                if (j >= weights[i]) {
                    dp[j] = Math.max(dp[j], dp[j - weights[i]] + values[i]);
                }
            }
        }
        System.out.println(dp[sumWeight]);
    }
}