HDU2215（最小圆覆盖问题）

题意：就是求最小圆覆盖问题

方法一：
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxx=1005;
const int inf=0x3f3f3f3f;
struct node{
	double x,y;
};
node b[maxx];
node o;
double R;
double sqr(double x){
	return x*x;
}
double dis(node a,node b){
	return sqrt(sqr(a.x-b.x)+sqr(a.y-b.y));
}
double incircle(node a){
	if(dis(o,a)<=R){
		return true;
	}
	return false;
}
node solve(double a,double b,double c,double d,double e,double f){
	double y=(f*a-c*d)/(b*d-e*a);
	double x=(f*b-c*e)/(a*e-b*d);
	return ((node){x,y});
}
int main(){
	int n;
	int t;
	while(scanf("%d",&n)!=EOF){
		if(n==0)break;
		for(int i=1;i<=n;i++){
			scanf("%lf %lf",&b[i].x,&b[i].y);
		}
		random_shuffle(b+1,b+n+1);
		R=0;
		for(int i=1;i<=n;i++){
			if(!incircle(b[i])){
				o.x=b[i].x;o.y=b[i].y;R=0;
				for(int j=1;j<i;j++){
					if(!incircle(b[j])){
						o.x=(b[i].x+b[j].x)/2;
						o.y=(b[i].y+b[j].y)/2;
						R=dis(o,b[i]);
						for(int k=1;k<j;k++){
							if(!incircle(b[k])){
								o=solve(
								b[i].x-b[j].x,b[i].y-b[j].y,(sqr(b[j].x)-sqr(b[i].x)+sqr(b[j].y)-sqr(b[i].y))/2,
								b[i].x-b[k].x,b[i].y-b[k].y,(sqr(b[k].x)-sqr(b[i].x)+sqr(b[k].y)-sqr(b[i].y))/2
								);
								R=dis(b[i],o);
							}
						}
					}
				}
			}
		}
	    printf("%.2lf\n",R+0.5);  
	} 
	return 0;
}

方法二：WA
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
const int maxx=1005;
const int inf=0x3f3f3f3f;
const int sep=1e-3;
const int base=0.99999;
struct node{
	double x,y;
};
node t[maxx];
int n;
double dist(node a,node b){
	double x=a.x-b.x;
	double y=a.y-b.y;
	return sqrt(x*x+y*y);
}
void solve(int n){
	double temp=1000.0,maxlen;
	double ans=1000000.0;
	int s=1;
	node mid;
	mid.x=0,mid.y=0;
	while(temp>sep){
		maxlen=0;
		for(int i=1;i<=n;i++){
			if(maxlen<dist(t[i],mid)){
				maxlen=dist(t[i],mid);
				s=i;
			}
		}
		ans=min(ans,maxlen);
		mid.x+=(t[s].x-mid.x)/maxlen*temp;
		mid.y+=(t[s].y-mid.y)/maxlen*temp;
		temp*=base;
	}
	printf("%.2lf\n",ans+0.5);
}
int main(){
	while(scanf("%d",&n)!=EOF){
		if(n==0)break;
		for(int i=1;i<=n;i++){
			scanf("%lf %lf",&t[i].x,&t[i].y);
		}
		solve(n);
	}
	return 0;
}