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 = maximizeScore(attractions, time, score, days);
System.out.println("在" + days + "天内,能够获得的最大评分为:" + result);
}
public static int maximizeScore(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] = dp[i - 1][j];
} else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - time[i - 1]] + score[i - 1]);
}
}
}
return dp[n][days];
}
}