动态规划之0-1背包问题

//求最优解的值：
int W = 17;  //初始背包容量
int n = 5;   //物品数量
int i;
int w;

int[] weight = { 3, 4, 7, 8, 9 }; //物品的重量
int[] v = {4, 5, 10, 11, 13 }; //各个物品的价值
int[,] c = new int[6, W + 1];
for (w = 0; w <= W; w++)
{
c[0, w] = 0;
}
for (i = 1; i <= n; i++)
{
c[i, 0] = 0;
for (w = 1; w <= W; w++)
{
if (weight[i-1] <= w)
{
if (v[i-1] + c[i - 1, w - weight[i-1]] > c[i - 1, w])
{
c[i, w] = v[i-1] + c[i -1, w - weight[i-1]];
}
else
{
c[i, w] = c[i - 1, w];
}
}
else
{
c[i, w] = c[i - 1, w];
}
}

}
txtShow.Text = c[n+1, W+1].ToString ();

//求最优解：
int[] x = new int[6];
for (i = n; i > 1; i--)
{
if (c[i, W] == c[i - 1, W])
{
x[i] = 0;
}
else
{
x[i] = 1;
W = W - weight[i];
}
}
if (c[1, W] == 0)
{
x[1] = 0;
}
else
{
x[1] = 1;
}

for (i=1;i<=n;i++)
{
if (x[i] == 1)
{
txtTwo.Text = txtTwo.Text + "   " + i.ToString();
}
}