编辑代码

#include <stdio.h>

// 定义最大值宏
#define max(a, b) ((a) > (b) ? (a) : (b))

// 函数：0/1背包问题的动态规划解法
int knapsack_01(int weights[], int values[], int n, int capacity) {
    int dp[n + 1][capacity + 1];

    // 初始化
    for (int i = 0; i <= n; ++i) {
        for (int j = 0; j <= capacity; ++j) {
            if (i == 0 || j == 0) {
                dp[i][j] = 0;
            } else if (weights[i - 1] > j) {
                dp[i][j] = dp[i - 1][j];
            } else {
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weights[i - 1]] + values[i - 1]);
            }
        }
    }

    // 返回结果
    return dp[n][capacity];
}

int main() {
    // 示例
    int weights[] = {2, 2, 4, 5, 3};
    int values[] = {3, 4, 8, 8, 6};
    int capacity = 9;
    int n = sizeof(weights) / sizeof(weights[0]);

    int result = knapsack_01(weights, values, n, capacity);
    printf("背包能装的最大价值是: %d\n", result);

    return 0;
}