hanker99的博客

#include<cstdio>#include<cstring>using namespace std;const int maxn=1000+5;int pa[maxn];void init(int n){ for(int i=0;i<=n;i++) pa[i]=i;}int findset(int x){ ...

You are given a forest — an undirected graph withnnvertices such that each its connected component is a tree.The diameter (aka "longest shortest path") of a connected undirected graph is the maxim...