原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
f n characters into two pieces. Suppose that you want to break a string into many pieces.
The order in which the breaks occur can affect the total amount of time used.
For example, suppose that you want to break a 20-character string after characters 2, 8,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea