Description: Assume it to be enough room in the arrangements in a number of activities and want to use the venue as small as possible. Design an efficient greedy algorithm to carry out the arrangements. Test Programming k for a given month to be arranged activities, calculated using the minimum of the venue. Input data, the first line is the value of k, the next k lines, each line has two positive integers, respectively, k a question that the activities arranged by the start time and end time, time to the beginning of 0:00 minutes. Output for at least a few of the venue.
To Search:
- [activitiesarrangements.Rar] - greedy algorithm activities arrangements
- [coins.Rar] - coins. Rar main data structures and algo
- [sche3] - Description of laquo: Suppose you want t
- [huichanganpai] - Greedy algorithm, the venue arrangements
- [work9] - Enough to assume that many of the arrang
- [123] - Arrangements for the completion of the v
- [LectureHalls] - acm algorithm design- the venue arrangem
File list (Check if you may need any files):
00.cpp
Download