← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

14 第14章 动态规划

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

, i − 1] = qi−1 5 for l = 1 to n 6 for i = 1 to n − l + 1 7 j = i + l − 1 8 e[i, j] = ∞ 9

w[i, j] = w[i, j − 1] + pj + qj

// equation (14.15) 10 for r = i to j // try all possible roots r 11 t = e[i, r − 1] + e[

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea