原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
easy case occurs when j = i − 1. Then the subproblem consists of just the dummy key di−1.
The expected search cost is e[i, i − 1] = qi−1.
When j ≥ i, you need to select a root kr from among ki, …, kj and then make an optimal bi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea