原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
y pi that any given search is for key ki. Since some searches may be for values not in K,
you also have n + 1 “dummy” keys d0, d1, d2,
…, dn representing those values. In particular, d0 represents all values less than k1, dn
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea