0-1背包英文版选读.ppt

【信任】【影响】【推荐】 * 【信任】【影响】【推荐】 * 【信任】【影响】【推荐】 * 遍历二叉树 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 算法设计与分析B【CS06081】 First for-loop: . We go through all the possible sizes of our knapsack until S and if item i is equal to 0, which is “V[0,s]” its corresponding maximum value is of course, 0. Because when i = 0, this means that we are not taking any item. Second for-loop: . We go through all the items from 1 to n and if the knapsack’s size is equal to 0, which is “V[i, 0]” its corresponding values is again 0. Because when s = 0, this means that we can’t put anything in the knapsack. First for-loop: . We go through all the possible sizes of our knapsack until S and if item i is equal to 0, which is “V[0,s]” its corresponding maximum value is of course, 0. Because when i = 0, this means that we are not taking any item. Second for-loop: . We go through all the items from 1 to n and if the knapsack’s size is equal to 0, which is “V[i, 0]” its corresponding values is again 0. Because when s = 0, this means that we can’t put anything in the knapsack. 座位分布图 1-4 计科1301-1304 5-8 通信1301-1304 9-10 物联1301-1302 4 6 5 2 1 8 7 讲 台 10 9 3 Lecture 9-动态规划 姜文君 wenjj8a@163.com 湖南大学-算法设计与分析课程 办公室：信息科学与工程学院院楼326 2014-2015第二学期 学科前沿：IT就业与择业 经验交流 动态规划案例-回顾与反思 总结 Outline 动态规划案例7-最优二叉搜索树 动态规划案例6-0-1背包问题 Problem description: Given n kinds of items, and a backpack. Is the weight of the items i wi, its value is the vi, backpack capacity of C. How should choose loaded backpack items, making loading items, the total value of the biggest in the backpack? case analysis 60-1 Knapsack problem 算法分析与设计 2015-4-16 * Set the son of 0-1 knapsack problem given the optimal value of m (I, j), m (I, j) is knapsack capacity of j, can choose items for the I, I + 1,... N when the optimal value of 0-1 knapsack problem. case analysis 60-1 Knapsack problem Dynamic programming step 1: analyze