编辑代码

#include <iostream>
#include <algorithm>

using namespace std;

// 景点结构体
struct Place {
    string name;
    int time;
    int score;
};

// 优化旅游行程的函数
Place* optimizeTour(int days, Place* places, int numPlaces) {
    // 创建动态规划表格
    int** dp = new int*[numPlaces + 1];
    for (int i = 0; i <= numPlaces; ++i) {
        dp[i] = new int[days + 1];
        fill(dp[i], dp[i] + days + 1, 0);
    }

    // 动态规划求解
    for (int i = 1; i <= numPlaces; ++i) {
        for (int j = 1; j <= days; ++j) {
            if (places[i - 1].time <= j) {
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - places[i - 1].time] + places[i - 1].score);
            } else {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }

    // 回溯找出选择的景点
    Place* selectedPlaces = new Place[numPlaces];
    int i = numPlaces, j = days, count = 0;
    while (i > 0 && j > 0) {
        if (dp[i][j] != dp[i - 1][j]) {
            selectedPlaces[count++] = places[i - 1];
            j -= places[i - 1].time;
        }
        --i;
    }

    // 释放动态规划表格的内存
    for (int i = 0; i <= numPlaces; ++i) {
        delete[] dp[i];
    }
    delete[] dp;

    return selectedPlaces;
}

int main() {
    // 初始化景点数组
    Place places[] = {
        {"故宫", 1, 7},
        {"颐和园", 2, 8},
        {"长城", 3, 9},
        {"天坛", 1, 6}
    };

    int numPlaces = sizeof(places) / sizeof(places[0]);
    int days = 4;

    // 求解最优景点选择
    Place* selected = optimizeTour(days, places, numPlaces);

    // 计算总评分
    int totalScore = 0;
    for (int i = 0; i < numPlaces; ++i) {
        totalScore += selected[i].score;
    }

    // 输出结果
    cout << "选择的景点及其信息：" << endl;
    for (int i = numPlaces - 1; i >= 0; --i) {
        cout << "景点：" << selected[i].name << "，时间：" << selected[i].time << "天，评分：" << selected[i].score << endl;
    }
    cout << "总评分：" << totalScore << endl;


    delete[] selected;
    return 0;
}