实现0-1背包的动态规划算法c

以下是实现0-1背包问题的动态规划算法的C语言代码：

#include <stdio.h>

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

int knapSack(int W, int wt[], int val[], int n) {
    int i, w;
    int K[n+1][W+1];

    for (i = 0; i <= n; i++) {
        for (w = 0; w <= W; w++) {
            if (i == 0 || w == 0)
                K[i][w] = 0;
            else if (wt[i-1] <= w)
                K[i][w] = max(val[i-1] + K[i-1][w-wt[i-1]], K[i-1][w]);
            else
                K[i][w] = K[i-1][w];
        }
    }

    return K[n][W];
}

int main() {
    int val[] = {60, 100, 120};
    int wt[] = {10, 20, 30};
    int W = 50;
    int n = sizeof(val)/sizeof(val[0]);
    printf("Maximum value that can be put in a knapsack of capacity %d is %d", W, knapSack(W, wt, val, n));
    return 0;
}

在此示例中，我们有一个重量为10, 20和30，价值为60, 100和120的三个物品。我们希望将它们放入容量为50的背包中，以获得最大价值。运行上面的代码后，输出应为：

Maximum value that can be put in a knapsack of capacity 50 is 220