← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

14 第14章 动态规划

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.695Z

, since k ≥ i, a chain of j − k matrices consists of fewer than j − i + 1 matrices. Thus,

the algorithm should fill in the table m from shorter matrix chains to longer matrix chains.

That is, for the subproblem of optimally parenthesizing the chain AiAi+1 ⋯ Aj, it makes s

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea