2018-2019 ACM-ICPC Southeastern European Regional (SEERC 2018) C Tree(level 2)(树的直径)(4种解法)
题目链接题意:给你一棵n个点的树(n=m,那么对答案进行更新这里为什么点k满足dis[x][k]4usingnamespacestd;constintN=100+5;vectorG[N];intdis[N][N],level[N],col[N],n,m;voidaddedge(intu,intv){G[u].push_back(v);G[v].push_back(u);}voidbfs(ints)