区间划分问题Interval 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.

       下面给出一个例子