原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
roblem in which each activity ai has, in addition to a start and finish time, a value vi.
The objective is no longer to maximize the number of activities scheduled, but instead to maximize the total value of the activities scheduled.
That is, the goal is to choose a set A of compatible activities such that is maximized. G
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea