原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
hown that am belongs to some maximum-size subset of mutually compatible activities of Sk.
If aj ≠ am, let the set be Ak but substituting am for aj. The activities in are compatible, which follows because the activities in Ak are compatible, aj is the first activity in Ak to finish, and fm ≤ fj.
Since , we conclude that is a maximum-size subset of mutually compatible activities of Sk
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea