【树的重心】POJ 3099 Go Go Gorelians

题目给定了一个三维坐标系的若干个点，每个点找离自己最近已知的点连边，形成一棵树，求这棵树的重心

按题意建边后，两次dfs求出直径，由于边权都是1，直接再直径上找中点即可

 

下图为样例的第二组图示

 

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
const int maxn=1005;
int n,id[maxn],tot;
vector <int> G[maxn];
double x[maxn],y[maxn],z[maxn],dis[maxn][maxn];
double calc(int i,int j)
{
	double dx=x[i]-x[j];
	double dy=y[i]-y[j];
	double dz=z[i]-z[j];
	return sqrt(dx*dx+dy*dy+dz*dz);
}
void build()
{
	for(int i=1;i<=n;i++)
	{
		double com=0x3ffffff;
		int flag=-1;
		for(int j=1;j<i;j++)
		{
			if(i==j) continue;
			if(dis[id[i]][id[j]]<com)
			{
				com=dis[id[i]][id[j]];
				flag=j;
			}
		}
		if(flag==-1) continue;
		G[id[i]].push_back(id[flag]);
		G[id[flag]].push_back(id[i]);
	}
}
int max_dis,st,ed,last[maxn],path[maxn],dist[maxn];
void dfs(int u,int fa,int len)
{
	dist[u]=len;
	for(int i=0;i<G[u].size();i++)
	{
		if(G[u][i]==fa) continue;
		if(len+1>max_dis)
		{
			max_dis=len+1;
			st=G[u][i];
		}
		dfs(G[u][i],u,len+1);
	}
}
void dfs1(int u,int fa,int len)
{
	dist[u]=len;
	last[u]=fa;
	for(int i=0;i<G[u].size();i++)
	{
		if(G[u][i]==fa) continue;
		if(len+1>max_dis)
		{
			max_dis=len+1;
			ed=G[u][i];
		}
		dfs1(G[u][i],u,len+1);
	}
}
int main()
{
	freopen("a.in","r",stdin);
	freopen("a.out","w",stdout);
	while(scanf("%d",&n)==1 && n)
	{
		memset(dist,0,sizeof(dist));
		memset(dis,0,sizeof(dis));
		memset(last,0,sizeof(last)); 
		for(int i=1;i<=n;i++) G[i].clear();
		for(int i=1;i<=n;i++) scanf("%d%lf%lf%lf",&id[i],&x[i],&y[i],&z[i]);
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				dis[id[i]][id[j]]=calc(i,j);
		//if(tot>0)
		//	n-=0;
		build();
		max_dis=0;
		dfs(id[1],-1,0);
		memset(dist,0,sizeof(dist)); max_dis=0;
		dfs1(st,-1,0);  tot=0;
		for(int i=ed;i!=-1;i=last[i]) 
			path[++tot]=i;
		int mid=(tot+1)/2;
		if(tot%2==1) printf("%d\n",path[mid]);
		else
		{
			int a=path[mid],b=path[mid+1];
			printf("%d %d\n",min(a,b),max(a,b));
		}
	}
	return 0;
}