编辑代码

#include <stdio.h>
#include <stdlib.h>

#define MAX_DAYS 4
#define MAX_SPOTS 4

//存放景点信息
typedef struct Place {
    char name[20]; //景点名
    int time;     //时间
    int score;    //评分
} Place;

int max(int a, int b) {  //取最大价值
    return a > b ? a : b;
}

void travel(Place places[], int n, int maxTime){
    int days = 4;
    int dp[MAX_DAYS + 1][MAX_SPOTS + 1] = {{0}};  //动态规划数组


    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= days; j++) {
            if (places[i-1].time > j) {   // 无法去这个景点，保留前i-1个景点的最优解
                dp[i][j] = dp[i-1][j];
            } else {                      // 可去这个景点
                dp[i][j] = max(dp[i-1][j], dp[i-1][j-places[i-1].time] + places[i-1].score);
            }
        }
    }

    // 输出最大价值
    printf("最大价值为：%d\n旅游景点为：", dp[n][days]);

    // 输出最优解
    int i = n, j = days;
    while (i > 0 && j > 0) {
        if (dp[i][j] != dp[i-1][j]) {
            printf("%s ", places[i-1].name);
            j -= places[i-1].time;
        }
        i--;
    }
    printf("\n");

}

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

    travel(places, MAX_DAYS, MAX_SPOTS);
    return 0;
}