编辑代码

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

typedef struct {
    char name[20];
    int time;
    int score;
} Attraction;

int max(int a, int b) {
    return (a > b) ? a : b;
}

Attraction optimize_trip(int days, Attraction attractions[], int num_attractions) {
    int dp[num_attractions + 1][days + 1];

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

    Attraction selected_attraction = attractions[num_attractions - 1];
    int i = num_attractions;
    int j = days;
    while (i > 0 && j > 0) {
        if (dp[i][j] != dp[i - 1][j]) {
            selected_attraction = attractions[i - 1];
            j -= attractions[i - 1].time;
        }
        i--;
    }

    return selected_attraction;
}

// 主函数
int main() {
    int days = 4;  // 总共4天时间
    Attraction attractions[] = {{"故宫", 1, 7}, {"颐和园", 2, 8}, {"长城", 3, 9}, {"天坛", 1, 6}};
    int num_attractions = sizeof(attractions) / sizeof(attractions[0]);

    Attraction selected_attraction = optimize_trip(days, attractions, num_attractions);

    printf("去以下景点能够获得最大价值:\n");
    for (int i = 0; i < num_attractions; i++) {
        if (attractions[i].time == selected_attraction.time && attractions[i].score == selected_attraction.score)
            printf("%s\n", attractions[i].name);
    }

    return 0;
}