uva 10803 - Thunder Mountain

//floyd算法

//floyd算法描述:1.它是基于动规的

//                     2.它是基于如下特点的:设k是i->j的中间点.那么:(1)如果从i到j的最短路径中不包含点k,则i->j的最短路径的点由1~(k-1)

//                                                                                          的点组成.

//                                                                                      (2)如果含k点,那么我们一定能用k点进行Relax().

//即下图的递推关系:

 

 

 

 

#include <iostream> #include <cstdio> #include <cmath> #include <memory.h> #define epsilon 1e-5 using namespace st