活动安排问题

一个由需要使用某一资源的n个活动组成的集合S = {1, 2, ... , n}，该资源一次只能被一个活动占用。每个活动i有个开始时间s[i]和结束时间f[i]，且s[i] <= f[i]。一旦被选择，活动i就占据半开时间区间[s[i], f[i])。如果[s[i], f[j])与[s[i], f[j])互不重叠，则称活动i和j是兼容的。活动安排问题就是要选择一个由互相兼容的问题组成的最大集合。-The activities of the organization of a need to use the n-a resource composed of a collection of activities S = (1, 2, ..., n), the resources can only be occupied by an activity. Each time i have to start s [i] and end times f [i], and s [i] <= f [i]. Once selected, activity i will occupy half-open time interval [s [i], f [i]). If [s [i], f [j]) and [s [i], f [j]) do not overlap each other, said the activities of i and j are compatible. Activities is to choose a compatible issue of the composition of the largest collections.