2013年6月15日

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) 编辑

POJ 2253 Frogger (求每条路径中最大值的最小值,Dijkstra变形)

摘要: FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:20314Accepted:6601DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen 阅读全文

posted @ 2013-06-15 18:30 kuangbin 阅读(737) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: