网站介绍:文章浏览阅读145次。思路:先用dijk求出最短路,利用pre[v]保存成另一个图,再用dfs深搜这个新图#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <string>#include <cstring>#inclu...
- 链接地址:https://blog.csdn.net/cry_admin/article/details/79545881
- 链接标题:1018. Public Bike Management (30)---dijk+dfs-CSDN博客
- 所属网站:blog.csdn.net
- 被收藏次数:105
- 网站标签:1018. Public Bike Management (30)---dijk+dfs