原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
s. Typically, the total number of distinct subproblems is a polynomial in the input size.
When a recursive algorithm revisits the same problem repeatedly, we say that the optimization problem has overlapping subproblems.
6 In contrast, a problem for which a divide-and-conquer approach is suitable usually gener
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea