CShap 背包问题 源代码

以下是C#中的背包问题代码：

using System;

public class Knapsack
{
static int max(int a, int b) { return (a > b) ? a : b; }

static int knapSack(int W, int[] wt, int[] val, int n)
{
int[,] K = new int[n + 1, W + 1];

for (int i = 0; i <= n; i++)
{
for (int 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];
}

public static void Main()
{
int[] val = new int[] { 60, 100, 120 };
int[] wt = new int[] { 10, 20, 30 };
int W = 50;
int n = val.Length;
Console.WriteLine(knapSack(W, wt, val, n));
}
}