原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
y dynamic programming, you need to allow the subproblems to vary at “both ends.” That is,
both i and j need to vary in the subproblem of parenthesizing the product
AiAi+1 ⋯ Aj. Optimal substructure varies across problem domains in two ways: how many sub
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea