![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
pat 甲
菜鸡的博客
这个作者很懒,什么都没留下…
展开
-
pat 1003 dijkstra
1003 Emergency (25分) 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 length of each road between any pair原创 2020-10-31 09:10:31 · 68 阅读 · 0 评论 -
1021. Deepest Root (25) [图的遍历,DFS,计算连通分量的个数]
思路:首先并查集判断联通分块的数量,只有一个联通分量,选择任意一个节点,到达最深的节点(记为节点集A),然后从A里面任意选择一个节点,到达最深的节点(记为节点集B),A和B的并集就是能够使树最高的节点。bfs好像会超内存。 柳神代码的思想:用dfs来判断联通块的数量,然后基本一样,代码要简短很多。 #include<stdio.h> #include<iostream> #include<vector> #include<set> #include<qu原创 2020-11-10 11:05:08 · 115 阅读 · 0 评论