2012年2月9日
POJ2485 求最小生成树的最大边长度
摘要： 此题关键要理解输出的定义For each test case, you should output a line contains an integer, which is the length of the longest road to be built such that all the villages are connected, and this value is minimum.输出是最小生成树中最长边的长度对prim算法稍作变化即可ACSource CodeProblem: 2485User: yangliuACMerMemory: 1232KTime: 750MSLangua 阅读全文
posted @ 2012-02-09 23:27 yangleo 阅读(221) 评论(0) 推荐(0)