原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
cost of an optimal solution recursively in terms of the optimal solutions to subproblems.
For the matrix-chain multiplication problem, a subproblem is to determine the minimum cost of parenthesizing AiAi+1 ⋯ Aj for 1 ≤ i ≤ j ≤ n. Given the input dimensions 〈p0, p1, p2,
…, pn〉, an index pair i, j specifies a subproblem. Let m[i, j] be the minimum number of s
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea