← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

15 第15章 贪心算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.702Z

ast one of these requests had a cache hit for S′ and a cache miss for S, a contradiction.

We conclude that if solution S has a cache hit and solution S′ has a cache miss upon the request for block bm, then some earlier request had the opposite result, and so solution S′ produces no more cache misses than solution S. Since S is assumed to be optimal, S′ is optimal as well.

▪ Along with the optimal-substructure property, Theorem 15.5 tells us that the furthest-i

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea