动态规划：背包问题

        /// <summary>
        /// 动态规划：背包问题
        /// </summary>
        private static void MaxVal()
        {
            int capacity = 16;  //背包负重
            int[] size = new int[] { 3,4,7,8,9 };       //物品大小    
            int[] values = new int[] { 4,5,10,11,13 };  //物品价值
            int[] totval = new int[capacity + 1];   //可负载物品的价值总量
            int[] best = new int[capacity + 1];     //可负载物品的价值的下标
            int n = values.Length;
            for (int j = 0; j <= n - 1; j++)
            {
                for (int i = 0; i <= capacity; i++)
                {
                    if (i >= size[j])   //背包重量大于任何一个物品的重量
                    {
                        if (totval[i] < (totval[i - size[j]] + values[j]))
                        {
                            totval[i] = totval[i - size[j]] + values[j];                          
                            best[i] = j;
                        }
                    }
                }
            }
            Console.WriteLine(totval[capacity]);       
        }