Description: Venue arrangements
Description
Assumed to be a sufficient number of arrangements for a number of activities inside the venue, and hoped to use as little as possible venue. To design an effective
Greedy algorithm to arrange. (This problem is actually well-known graph coloring problem. If we each activity as a graph
Vertex, between incompatible activities connected with the edge. So that adjacent vertices have different colors with minimum chromatic number, corresponding to the minimum to find
Site number. )
Programming tasks:
For a given k were to be arranged activities, calculated using the programming schedule for at least the venue.
Input
Given input data from the file input.txt. The first line has a positive integer k, that there are k-to be arranged activities. Then
K down the line, each line has two positive integers k, respectively, the activities were to be arranged start time and end time. Time
To 0:00 start of the minutes.
Output
Will be programmed to calculate th
To Search:
File list (Check if you may need any files):
huichanganpaiwenti.cpp
Download