Description: With n-set of the activities of E = (1,2, ..., n), where each activity requires the use of the same resource, such as the lecture hall, etc., but at the same time, only one activity can use this resource. Each activity i has a request to use the resources of the starting time si and an end time fi, and the si <fi 。如果选择了活动i，则它在半开时间区间[si, fi)内占用资源。若区间[si, fi)与区间[sj, fj)不相交，则称活动i与活动j是相容的。也就是说，当si≥fj或sj≥fi时，活动i与活动j相容。
To Search:
File list (Check if you may need any files):
GreedySelector.java
Download