原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
ion of the remainder. Then we can express the solution with no cuts at all by saying that
the first piece has size i = n and revenue pn and that the remainder has size 0 with corresponding revenue r0 = 0.
We thus obtain the following simpler version of equation (14.1): In this formulation, an
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea