hdu2215 凸包+ 最小圆覆盖

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2215

题意：给出n颗树，每颗树的直径为1，求一个圆的最小半径，使得这个圆覆盖所有的树。

代码如下：

#include<iostream>
#include<cstdio>
#include<math.h>
#include<algorithm>
#define eps 1e-8

const int maxn=10000;
struct point {double x,y;}cen,p[maxn],po,save[maxn];
double r;
int n,nsave;

double distance(point p1,point p2)
{
	return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
double dist2(point p1,point p2)
{
	return (p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y);
}

double xmult(point p1,point p2,point p0)
{
	return (p1.x-p0.x)*(p2.y-p0.y)-(p1.y-p0.y)*(p2.x-p0.x);
}
double max(double a,double b){return a>b? a:b;}
bool cmp(const point &a,const point &b )
{
	if(a.y==b.y)return a.x<b.x;
	return a.y<b.y;
}
int Graham()
{
	int i;
	std::sort(p,p+n,cmp);
	save[0]=p[0];
	save[1]=p[1];
	int top=1;
	for(i=0;i<n;i++)
	{
		while(top>0&& xmult(save[top],p[i],save[top-1])>=0)top--;
		save[++top]=p[i];
	}
	int mid=top;
	for(i=n-2;i>=0;i--)
	{
		while(top>mid&&xmult(save[top],p[i],save[top-1])>=0)top--;
		save[++top]=p[i];
	}
	return top;
}

//直线a1X+ b1Y+c1=0与a2X+b2Y+c2=0的交点
void calc(double a1,double b1,double c1,double a2,double b2,double c2)
{
	cen.y=(c1*a2-c2*a1)/(b1*a2-b2*a1);
	cen.x=(c1*b2-c2*b1)/(a1*b2-b1*a2);
}
void cir()
{
	cen=p[0];r=0;
	int i,j,k;
	for(i=1;i<n;i++)if(distance(cen,p[i])-r>eps)
	{
		cen=p[i];
		r=0;
		for(j=0;j<=i-1;j++)if(distance(cen,p[j])-r>eps)
		{
			cen.x=(p[i].x+p[j].x)/2.0;
			cen.y=(p[i].y+p[j].y)/2.0;
			r=distance(cen,p[j]);
			for(k=0;k<=j-1;k++)if(distance(cen,p[k])-r>eps)
			{
				calc(p[j].x-p[i].x,
					p[j].y-p[i].y,
					(dist2(p[j],po)-dist2(p[i],po))/2.0,
					p[k].x-p[i].x,
					p[k].y-p[i].y,
					(dist2(p[k],po)-dist2(p[i],po))/2.0
					);
				r=distance(cen,p[k]);
			}
		}
	}
}
int main()
{
	po.x=0;
	po.y=0;
	while(scanf("%d",&n),n)
	{
		int i;
		for(i=0;i<n;i++)
		{
			scanf("%lf%lf",&p[i].x,&p[i].y);
		}
		nsave=Graham();
		n=nsave;
		for(i=0;i<nsave;i++)p[i]=save[i];
		cir();
		printf("%.2lf\n",r+0.5);
	}
	return 0;
}