编辑代码

public class TravelOptimization {

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

        int[][] dp = new int[attractions.length + 1][totalDays + 1];

        for (int i = 1; i <= attractions.length; i++) {
            for (int j = 1; j <= totalDays; j++) {
                if (daysNeeded[i - 1] <= j) {
                    dp[i][j] = Math.max(dp[i - 1][j], scores[i - 1] + dp[i - 1][j - daysNeeded[i - 1]]);
                } else {
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }

        // 打印最大价值
        System.out.println("最大价值：" + dp[attractions.length][totalDays]);

        // 打印所选景点
        int remainingDays = totalDays;
        for (int i = attractions.length; i > 0 && remainingDays > 0; i--) {
            if (dp[i][remainingDays] != dp[i - 1][remainingDays]) {
                System.out.println("选择景点：" + attractions[i - 1] + "，时间：" + daysNeeded[i - 1] + "天，评分：" + scores[i - 1]);
                remainingDays -= daysNeeded[i - 1];
            }
        }
    }
}