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

Interval PartitioningInterval partitioning. Lecture j starts at sj and finishes at fj. Goal: find minimum number of classrooms to schedule all lectures so that no two occur at the same time in the same room.

Ex: This schedule uses only 3.

3 2 1

c b a9 9:30 10 10:30 11

d

f g e h1 1:30 2 2:30 3 3:30

j

i

11:30

12

12:30

4

4:30

Time11

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