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
04greedy算法设计与分析 贪心算法(3)
2021-02-21 09:31
04greedy算法设计与分析 贪心算法(3).doc
将本文的Word文档下载到电脑
下载失败或者文档不完整，请联系客服人员解决！