原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
a1, a2, … , an} of tasks, where task ai requires pi units of processing time to complete.
Let Ci be the completion time of task ai, that is, the time at which task ai completes processing.
Your goal is to minimize the average completion time, that is, to minimize . For example,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea