原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
ructure, let’s define the subproblem (C, i) as processing requests for blocks bi, bi+1, …
, bn with cache configuration C at the time that the request for block bi occurs
, that is, C is a subset of the set of blocks such that |C | ≤ k. A solution to subproblem
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea