原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
n2) distinct subproblems, and the dynamic-programming algorithm solves each exactly once.
The recursive algorithm, on the other hand, must solve each subproblem every time it reappears in the recursion tree.
Whenever a recursion tree for the natural recursive solution to a problem contains the sa
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea