新知识点树的重心
龟速AC代码(763ms)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#include <functional>
#include <vector>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
const int maxn=1e5+50;
const int inf=0x3f3f3f3f;
const int MOD=1e9+7;
const int HASH=131;
int head[maxn];
int p[maxn];
int n;
int tot;
int siz;
int k,ans;
int sz[maxn];
int sign;
struct node
{
int to,next;
}E[maxn*2];
void adde(int x,int y)
{
E[tot].to=y;
E[tot].next=head[x];
head[x]=tot++;
}
void add(int x,int y)
{
adde(x,y);
adde(y,x);
}
void dfs(int u,int father)
{
sz[u]=1;
int num=0;//num存大小
for(int i=head[u];~i;i=E[i].next)
{
int j=E[i].to;
if(j!=father)
{
dfs(j,u);
sz[u]+=sz[j];
num=max(num,sz[j]);
}
}
num=max(num,n-sz[u]);//n为总结点数量
if(num<=siz)
{
if(num==siz&&k!=ans)
{
ans=u;
sign=1;//标记是否出现2个重心
}
if(num<siz)
{
k=u;
siz=num;
sign=0;
}
}
}
void init()
{
memset(E,0,sizeof(E));
memset(sz,0,sizeof(sz));
memset(head,-1,sizeof(head));
tot=0;
siz=inf;
k=-1;
ans=-1;
sign=0;
}
int main()
{
int t;
cin>>t;
while(t--)
{
cin>>n;
init();
for(int i=1;i<n;i++)
{
int x,y;
cin>>x>>y;
add(x,y);
}
dfs(1,0);
if(sign)
{
int tmp=E[head[k]].to;
if(tmp==ans)
{
tmp=E[head[k]].next;
tmp=E[tmp].to;
}
printf("%d %d\n%d %d\n",k,tmp,tmp,ans);
}
else
{
printf("%d %d\n%d %d\n",k,E[head[k]].to,k,E[head[k]].to);
}
}
return 0;
}