![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
提着布鞋光脚跑
muggle
展开
-
1003 Emergency (25 分)题解(Dijkstra算法)详细注释
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the l...原创 2019-12-03 12:14:33 · 528 阅读 · 0 评论 -
[最短路径弗洛伊德算法]三层循环顺序问题
[最短路径弗洛伊德算法](三层循环顺序问题)先上代码for(int i=0;i<city;i++) for(int j=0;j<city;j++) for(int k=0;k<city;k++) { if(length[j][i]+length[i][k]<length[j][k]) length[j][k]=length[j][i]...原创 2019-10-06 22:55:27 · 1846 阅读 · 0 评论