Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <algorithm>#include <iostream>#include <cstring>#include <cstdio>#include <vector>#include <cmath>#define mod 1000000007using namespace std;vector <int> edges[100008];int maxn,nown;void dfs(int u,int dep,int fa){if(dep>maxn) {maxn=dep;nown=u;}for(int i=0;i<(int)edges[u].size();i++){int v=edges[u][i];if(v!=fa) dfs(v,dep+1,u);}}int main(){int n,i;scanf("%d",&n);for(i=1;i<=n;i++)edges[i].clear();for(i=1;i<n;i++){int u,v;scanf("%d%d",&u,&v);edges[u].push_back(v);edges[v].push_back(u);