POJ 2420 A Star not a Tree?

题目描述：平面上给你n个点，让你求一个点，到这n点的距离和最小。

#include <iostream>
#include <ctime>
#include <algorithm>
#include <cmath>
#define PI acos(-1.0)
#define N 150
using namespace std;

int n,m;
double x,y,ans[N],u[N],v[N];
struct node
{
	double x,y;
}point[N];
void min_dis(double xx,double yy,double &inf)
{
	int i;
	double d=0;
	for(i=0;i<n;i++)
		d+=sqrt((xx-u[i])*(xx-u[i])+(yy-v[i])*(yy-v[i]));
	inf=d;
}
int main()
{
	int i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&u[i],&v[i]);
		if(u[i]>x)
			x=u[i];
		if(v[i]>y)
			y=v[i];
	}
	srand((unsigned)time(NULL));
	int p=10,l=30;
	for(i=0;i<p;i++)
	{
		point[i].x=(rand()%101)/100*x;
		point[i].y=(rand()%101)/100*y;
		min_dis(point[i].x,point[i].y,ans[i]);
	}
	double delta=(x>y?x:y)/sqrt(n*1.0),eps=1e-2;
	while(delta>eps)
	{
		for(i=0;i<p;i++)
			for(j=0;j<l;j++)
			{
				double an=(rand()%101)/100.0*2.0*PI;
				double vx=point[i].x+delta*cos(an);
				double vy=point[i].y+delta*sin(an);
				if(vx<0 || vy<0 || vx>x || vy>y)
					continue;
				double inf;
				min_dis(vx,vy,inf);
				if(ans[i]>inf)
				{
					ans[i]=inf;
					point[i].x=vx;
					point[i].y=vy;
				}
			}
		delta*=0.8;
	}
	double inf=ans[0];
	for(i=0;i<p;i++)
		if(ans[i]<inf)
			inf=ans[i];
	printf("%.0lf\n",inf);
	return 0;
}