原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
ith all previously selected activities. Such an activity is the earliest in Sk to finish.
To see whether activity am is compatible with every activity currently in A, it suffices by equation (15.3) to check (in line 4) that its start time sm is not earlier than the finish time fk of the activity most recently added to A.
If activity am is compatible, then lines 5–6 add activity am to A and set k to m. The set
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea