a09-chap15(三)-dp 算法导论 知识讲稿.pptVIP

1 Scheduling two automobile assembly lines （流水线、装配线调度） Matrix-chain multiplication （矩阵链相乘，或矩阵连乘问题） Characteristics of dynamic programming （动态规划法的特征） Longest common subsequence （最长相同子序列） Optimal binary search trees （最优二叉搜索树） 15 Dynamic Programming 2 Optimal substructure (We have already known) A1A2A3A4A5A6 ((A1(A2A3)) ((A4A5)A6)) 3 When the dynamic-programming method applies? Mentioned already: optimal substructure overlapping subproblems 15.3 Elements of dynamic programming 4 Optimal substructure : an optimal solution to the problem contains within it optimal solutions to subproblems. （问题的最优解包含子问题的最优解） 15.3.1 Optimal substructure A1A2A3A4A5A6 ((A1(A2A3)) ((A4A5)A6)) A1A2A3 (A1(A2A3)) 5 Make a choice Leave one or more subproblems to solve Given a choice that leads to an optimal solution, determine which subproblems arise and how to characterize the resulting space of subproblems. （给定一个能产生最优解的选择，问：怎样的子问题出现？如何对子问题的解空间进行特征化？） Show that the solutions to the subproblems used within the optimal solution must themselves be optimal. Cut-and-paste: （出现在‘原问题的最优解’中的‘子问题的解’必定是该子问题的最优解） Suppose that one of the subproblem solutions is not optimal. Cut it out. Paste in an optimal solution. Get a better solution to the original problem. Contradiction. 15.3.1 Optimal substructure 8 Optimal substructure varies across problem domains: How many choices in determining which subproblem(s) to use. After the choice, how many optimal subproblems are shown in an optimal solution to the original problem. Assembly-line scheduling two choices (for Si, j use either S1, j-1 or S2, j-1) one optimal subproblem 15.3.1 Optimal substructure 9 Optimal substructure varies across problem domains: How many choices ; How many subproblems Mmatrix-chain multiplication Ai Ai+1…Aj j-i choices We choose from among j-i candidates for the index k. two optimal subproblems For a given matrix Ak , two subproblems: parenthesizing AiAi+1…Ak and parenthesizing Ak+1Ak+2…Aj , How to solve both of t