acm算法设计—会场安排问题！

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。)

对于给定的k个待安排的活动，编程计算使用最少会场的时间表。,acm algorithm design- the venue arrangements! Assume it to be enough room in the arrangements in a number of activities and want to use the venue as small as possible. The design of an effective arrangement of the greedy algorithm. (This issue is well-known graph coloring problem. If each activity as a graph vertex, between the incompatible activities connected with edges. So that adjacent vertices have different colors of coloring the smallest number, which corresponds to looking for the smallest number of the venue.) k for a given month to be arranged activities, calculated using the programming schedule for the venue at least.