原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
greedy choice for this problem. Exercise 15.1-3 asks you to explore other possibilities.
Once you make the greedy choice, you have only one remaining subproblem to solve: finding activities that start after a1 finishes.
Why don’t you have to consider activities that finish before a1 starts? Because s1 < f1,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea