1021 Deepest Root(dfs 求强连通分量的个数(并查集))
1021 Deepest Root (25 分)
A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a ...
原创
2019-06-27 22:51:35 ·
294 阅读 ·
0 评论