活动安排问题。设有n个活动的集合E={1, 2, …, n}，其中每个活动都要求使用同一资源（如演讲会场），而在同一时间内只有一个活动能使用这一资源。每个活动i都有一个要求使用该资源的起始时间si和一个结束时间fi，且si <fi 。如果选择了活动i，则它在半开时间区间[si, fi)内占用资源。若区间[si, fi)与区间[sj, fj)不相交，则称活动i与活动j是相容的。也就是说，当si≥fj或sj≥fi时，活动i与活动j相容。活动安排问题要求在所给的活动集合中选出最大的相容活动子集。-Activity arrangement problem. Has a collection of n activities E = {1, 2,... , n}, each of these activities are required to use the same resources (e.g., lecture hall), and at the same time only one activity can use the resources. Each activity I have one requires the use of the resources the starting time of si and an end time fi, and si < fi. If I chose the activity, is it in half the time interval [si, fi) takes up resources. If [si, fi) and interval [sj, fj) disjoint, said I and j is compatible. That is to say, when si fj or sj acuity or fi, activity I and j incompatible. Activity arrangements from the set of requirements in the given activity to select the largest subset incompatible activities.