![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路
绝不挂科
这个作者很懒,什么都没留下…
展开
-
第三次-H-poj-3126-BFS+打表
poj-3126The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.— It is a matt...原创 2019-01-26 23:32:47 · 129 阅读 · 0 评论 -
第十天-G-uva-11624-最短路
poj-2387题意:告诉你边数m,点数n,接下来m行点,点,距离,求1~n的最短距离但是要考虑重边,即2到3可能不止一条路,只需记录最短的那条路,用迪杰斯特拉有关最短路#include <stdio.h>#include <string.h>int dis[1005];int s[1005][1005];int book[1005], min;int原创 2019-01-29 16:43:02 · 93 阅读 · 0 评论