arrangement
代码说明：
假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
文件列表：
Arrangement3.cpp,2035,2014-04-23
Arrangement3.dsp,3473,2014-04-23
Arrangement3.dsw,532,2014-04-23
Arrangement3.ncb,41984,2014-04-23
Arrangement3.opt,48640,2014-04-23
Arrangement3.plg,1170,2014-04-23
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
