Slayer_Zhao的博客

Dijkstra最短路算法转载自【啊哈！算法】系列7：Dijkstra最短路算法http://ahalei.blog.51cto.com/4767671/1387799              上一篇博客我们介绍了神奇的只有五行的Floyd最短路算法，它可以方便的求得任意两点的最短路径，这称为“多源最短路”。本篇来介绍指定一个点（源点）到其余各个顶点的最短路径，也叫做“单源最短路径”。例如求下图...

只有五行的Floyd最短路算法转载自http://bbs.ahalei.com/thread-4554-1-1.html(出处: 啊哈磊_编程从这里起步)       暑假，小哼准备去一些城市旅游。有些城市之间有公路，有些城市之间则没有，如下图。为了节省经费以及方便计划旅程，小哼希望在出发之前知道任意两个城市之前的最短路程。       上图中有4个城市8条公路，公路上的数字表示这条公路的长短。请...

ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26393 Accepted: 11121DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency ...

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14363 Accepted: 8048DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we ...

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 55089 Accepted: 17361DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sittin...

Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 44007 Accepted: 11534DescriptionBackground Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now ...

Til the Cows Come Home                                             Time Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%lld & %lluDescriptionBessie is out in the field and wants to get ba...