04greedy算法设计与分析 贪心算法(3)

Interval SchedulingInterval scheduling. Job j starts at sj and finishes at fj. Two jobs compatible if they don't overlap. Goal: find maximum subset of mutually compatible jobs.

ab c d e

fg h0 1 2 3 4 5 6 7 8 9 10 11

Time3

百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读，免费范文网，提供经典小说教育文库04greedy算法设计与分析 贪心算法(3)在线全文阅读。