Description: 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.
To Search:
File list (Check if you may need any files):
活动安排问题.cpp
Download