POJ 1797 Heavy Transportation (Dijkstra算法,求路径的最小值中的最大值)
摘要:
Heavy TransportationTime Limit:3000MSMemory Limit:30000KTotal Submissions:17314Accepted:4546DescriptionBackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu 阅读全文
posted @ 2013-06-15 18:33 kuangbin 阅读(1002) 评论(0) 推荐(0) 编辑