编辑代码

public class TravelOptimization {

    public static void main(String[] args) {
        String[] attractions = {"故宫", "颐和园", "长城", "天坛"};
        int[] time = {1, 2, 3, 1};
        int[] score = {7, 8, 9, 6};
        int days = 4;

        int[] result = maximizeValue(attractions, time, score, days);

        System.out.println("最大价值的景点是：");
        for (int i = 0; i < result.length; i++) {
            if (result[i] == 1) {
                System.out.println(attractions[i]);
            }
        }
    }

    public static int[] maximizeValue(String[] attractions, int[] time, int[] score, int days) {
        int n = attractions.length;
        int[][] dp = new int[n + 1][days + 1];

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= days; j++) {
                if (time[i - 1] <= j) {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - time[i - 1]] + score[i - 1]);
                } else {
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }

        int[] result = new int[n];
        int i = n, j = days;
        while (i > 0 && j > 0) {
            if (dp[i][j] != dp[i - 1][j]) {
                result[i - 1] = 1;
                j -= time[i - 1];
            }
            i--;
        }

        return result;
    }
}