poj1379---计算几何

//模拟退火算法
//1、随机选取一个足够大的温度T作为开始
//2、随机选取P个起始点，作为可行解
//3、分别更新这P个可行解
//4、减小温度T，直到终止条件
//5、转到1

#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<time.h>
#define dist(a,b) sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))
#define cross(a,b,c) (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x)
#define dot(a,b,c) (b.x-a.x)*(c.x-a.x)+(b.y-a.y)*(c.y-a.y)
#define delt(a) fabs(a)<eps?0:a>0?1:-1
#define pi acos(-1.0)
#define eps 1e-2
#define inf 1e20
#define N 1005
using namespace std;
int n,m,t,nl,ml;
struct TPoint
{
	double x,y,dis;
}pt[N],ans[12],mid;
void scan()
{
	scanf("%d%d%d",&nl,&ml,&n);
	for(int i=0;i<n;i++) scanf("%lf%lf",&pt[i].x,&pt[i].y);
}
void init()
{
	srand(unsigned(NULL));
	for(int i=0;i<10;i++)
	{
		ans[i].x=rand()%nl,ans[i].y=rand()%ml;
		double minl=inf;
		for(int j=0;j<n;j++)
		{
			minl=min(minl,dist(ans[i],pt[j]));
		}
		ans[i].dis=minl;
	}
}
int main()
{
	int i,j,k;
	scanf("%d",&t);
	while(t--)
	{
		srand(unsigned(NULL));
		scan(),init();
		double delta,angle,minl;
		delta=sqrt(1.0*nl*nl+ml*ml);
		while(delta>eps)
		{
			for(i=0;i<10;i++)
			{
				for(j=0;j<30;j++)
				{
					angle=2*pi*((rand()%100+1)/100.0);//以可行解i为圆心，更新可行解i
					mid.x=ans[i].x+delta*cos(angle);
					mid.y=ans[i].y+delta*sin(angle);
					if(mid.x<0||mid.y<0||mid.x>nl||mid.y>ml) continue;
					for(k=0,minl=inf;k<n;k++)
					{
						minl=min(minl,dist(mid,pt[k]));
					}
					mid.dis=minl;
					if(minl>ans[i].dis) ans[i]=mid;
				}
			}
			delta*=0.8;
		}
		for(i=j=0,minl=0;i<10;i++)
		{
			if(ans[i].dis>minl) minl=ans[i].dis,j=i;
		}
		printf("The safest point is (%.1f, %.1f).\n",ans[j].x,ans[j].y);
	}
	return 0;
}