编辑代码

#include <stdio.h>

#define MAX_DAYS 4
#define NUM_PLACES 4

typedef struct {
    char name[20];
    int days;
    int score;
} Place;

// 动态规划函数
void optimizeTrip(Place places[], int dp[][MAX_DAYS + 1], int num_places, int max_days) {
    for (int i = 0; i <= num_places; i++) {
        for (int j = 0; j <= max_days; j++) {
            if (i == 0 || j == 0) {
                dp[i][j] = 0;
            } else if (places[i - 1].days <= j) {
                dp[i][j] = (places[i - 1].score + dp[i - 1][j - places[i - 1].days] > dp[i - 1][j]) ?
                            places[i - 1].score + dp[i - 1][j - places[i - 1].days] : dp[i - 1][j];
            } else {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
}

// 打印最优解
void printOptimalTrip(Place places[], int dp[][MAX_DAYS + 1], int num_places, int max_days) {
    int i = num_places;
    int j = max_days;

    while (i > 0 && j > 0) {
        if (dp[i][j] != dp[i - 1][j]) {
            printf("去%s，时间：%d天，评分：%d分\n", places[i - 1].name, places[i - 1].days, places[i - 1].score);
            j -= places[i - 1].days;
        }
        i--;
    }
}

int main() {
    Place places[] = {
        {"故宫", 1, 7},
        {"颐和园", 2, 8},
        {"长城", 3, 9},
        {"天坛", 1, 6}
    };

    int dp[NUM_PLACES + 1][MAX_DAYS + 1];

    optimizeTrip(places, dp, NUM_PLACES, MAX_DAYS);

    printf("最优旅游行程如下：\n");
    printOptimalTrip(places, dp, NUM_PLACES, MAX_DAYS);

    return 0;
}