L2-001. 紧急救援-Dijkstra算法的综合运用
#include "iostream"using namespace std;#define Max 500#define Sky 99999int Graph[Max][Max],Top,Start,End,Edge;int Dist[Max],Move[Max],Peo[Max],Sum[Max],Way[Max];void Dis(){ int i,j; for(i=
转载
2016-05-25 21:36:39 ·
2297 阅读 ·
0 评论