zamaochick的博客

Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network. Input In the first line, two integer nn an...

A graph which is connected and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root i...

We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to send a file from any computer ...

题目链接： 传送门 思路： 求连通块，因为一个连通块上的顶点在经过无数次传递之后肯定能经过同一个点，所以就求出连通块的数目，然后计算，然后累加前m大的即可。 代码如下： #include <cstdio> #include <cstring> #include <algorithm> #include <iostream> using...