原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
ng the matrix product Ai:kAk+1:j takes pi−1 pk pj scalar multiplications. Thus, we obtain
m[i, j] = m[i, k] + m[k + 1, j] + pi−1 pk pj.
This recursive equation assumes that you know the value of k. But you don’t, at least not
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea