原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
the room from one activity to the next, the changeover time is built into the intervals.)
In the activity-selection problem, your goal is to select a maximum-size subset of mutually compatible activities.
Assume that the activities are sorted in monotonically increasing order of finish time: (
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea