国外算法设计和分析课件12.ppt

Dynamic Programming Expected Outcomes Students should be able to Write down the four steps of dynamic programming Compute a Fibonacci number and the binomial coefficients by dynamic programming Compute the longest common subsequence and the shortest common supersequence of two given sequences by dynamic programming Solve the invest problem by dynamic programming Dynamic Programming Frame of Dynamic Programming Problem solved Solution can be expressed in a recursive way Sub-problems occur repeatedly Subsequence of optimal solution is an optimal solution to the sub-problem Frame Characterize the structure of an optimal solution Recursively define the value of an optimal solution Compute the value of an optimal solution in a bottom-up fashion Construct an optimal solution from computed information Three basic components The development of a dynamic programming algorithm has three basic components: A recurrence relation (for defining the value/cost of an optimal solution); A tabular computation (for computing the value of an optimal solution); A backtracing procedure (for delivering an optimal solution). Example: Fibonacci numbers Example: Fibonacci numbers Examples of Dynamic Programming Computing Binomial Coefficients A binomial coefficient, denoted C(n, k), is the number of combinations of k elements from an n-element set (0 ≤ k ≤ n). Recurrence relation (a problem ? 2 overlapping subproblems) C(n, k) = C(n-1, k-1) + C(n-1, k), for n k 0, and C(n, 0) = C(n, n) = 1 Dynamic programming solution: Record the values of the binomial coefficients in a table of n+1 rows and k+1 columns, numbered from 0 to n and 0 to k respectively. 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 … Dynamic Binomial Coefficient Algorithm for i = 0 to n do for j = 0 to minimum( i, k ) do if j = 0 or j = i then BiCoeff[ i, j ] = 1 else BiCoeff[ i, j ] = BiCoeff[ i-1, j-1 ] + BiCoeff[ i-1, j ] end if end for