zoj1450 最小圆覆盖

随机增量法，期望O(n)，小红书模板

#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#define maxl 110
#define eps 1e-8
using namespace std;

inline int sgn(double x)
{
	if(x>-eps && x<eps) return 0;
	if(x>0) return 1;
	else	return -1;
}

struct point 
{
	double x,y;
	point(double a=0,double b=0)
	{
		x=a;y=b;
	}
	point operator - (const point &b)const
	{
		return point(x-b.x,y-b.y);
	}
	friend point operator * (const double t,const point &p)
	{
		return point(t*p.x,t*p.y);
	}
	inline double norm()
	{
		return sqrt(x*x+y*y);
	}
};
inline double dot(const point &a,const point &b)
{
	return a.x*b.x+a.y*b.y;
}
inline double det(const point &a,const point &b)
{
	return a.x*b.y-a.y*b.x;
}

int n;
point a[maxl];
point center;
double radius;

inline void prework()
{
	for(int i=0;i<n;i++)
		scanf("%lf%lf",&a[i].x,&a[i].y);
	srand(time(0));
	for(int i=1;i<=n;i++)
	{
		int x=rand()%n,y=rand()%n;
		if(x!=y)
			swap(a[x],a[y]);
	}
}

inline void circle_center(point p0,point p1,point p2,point &cp)
{
	double a1=p1.x-p0.x,b1=p1.y-p0.y,c1=(a1*a1+b1*b1)/2;
	double a2=p2.x-p0.x,b2=p2.y-p0.y,c2=(a2*a2+b2*b2)/2;
	double d=a1*b2-a2*b1;
	cp.x=p0.x+(c1*b2-c2*b1)/d;
	cp.y=p0.y+(a1*c2-a2*c1)/d;
}

inline void circle_center(point p0,point p1,point &cp)
{
	cp.x=(p0.x+p1.x)/2;
	cp.y=(p0.y+p1.y)/2;
}

inline bool point_in(const point &p)
{
	return sgn((p-center).norm()-radius)<0;
}

void min_circle_cover(point a[],int n)
{
	radius=0;
	center=a[0];
	for(int i=1;i<n;i++)
	if(!point_in(a[i]))
	{
		center=a[i];radius=0;
		for(int j=0;j<i;j++)
		if(!point_in(a[j]))
		{
			circle_center(a[i],a[j],center);
			radius=(a[j]-center).norm();
			for(int k=0;k<j;k++)
			if(!point_in(a[k]))
			{
				circle_center(a[i],a[j],a[k],center);
				radius=(a[k]-center).norm();
			}
		}
	}
}

inline void mainwork()
{
	min_circle_cover(a,n);
}

inline void print()
{
	printf("%.2f %.2f %.2f\n",center.x,center.y,radius);
}

int main()
{
	while(~scanf("%d",&n) && n)
	{
		prework();
		mainwork();
		print();
	}
	return 0;
}