[BZOJ2823][最小圆覆盖]AHOI2012：信号塔

BZOJ2823

最小圆覆盖模板题

Code：

#include<bits/stdc++.h>
#define db double
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=1e6+5;
db r=0.0;
struct point{db x,y;}o,p[N];
struct line{db a,b,c;};
inline db pow2(db x){return x*x;}
inline db dis(point a,point b){return sqrt(pow2(a.x-b.x)+pow2(a.y-b.y));}
inline bool check(point x){return dis(o,x)<=r;}
inline point con(line a,line b){return point{(b.c*a.b-a.c*b.b)/(a.a*b.b-a.b*b.a),(b.c*a.a-a.c*b.a)/(a.b*b.a-b.b*a.a)};}
int main(){
	int n=read();
	for(int i=1;i<=n;i++) scanf("%lf%lf",&p[i].x,&p[i].y);
	random_shuffle(p+1,p+n+1);
	for(int i=1;i<=n;i++)
		if(!check(p[i])){
			o.x=p[i].x,o.y=p[i].y;r=0;
			for(int j=1;j<i;j++)
				if(!check(p[j])){
					o.x=(p[i].x+p[j].x)/2,o.y=(p[i].y+p[j].y)/2;
					r=dis(o,p[i]);
					for(int k=1;k<j;k++)
						if(!check(p[k])){
							o=con(line{2*(p[i].x-p[k].x),2*(p[i].y-p[k].y),pow2(p[k].x)+pow2(p[k].y)-pow2(p[i].x)-pow2(p[i].y)},line{2*(p[i].x-p[j].x),2*(p[i].y-p[j].y),pow2(p[j].x)+pow2(p[j].y)-pow2(p[i].x)-pow2(p[i].y)});
                			r=dis(p[i],o);
						}			
				}
		}
	printf("%.2lf %.2lf %.2lf",o.x,o.y,r);
	return 0;
}