ACM-ICPC Nanjing Onsite 2018 - 最小球覆盖

题目链接:https://nanti.jisuanke.com/t/33673

 

解题思路:

这已经是老的不能再老的题了，模拟退火或者三分套三分套三分等等都可以。

 

三分代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-7;
const int mx = 1e3+5;
#define fi first
#define se second
int x,y,n;
double xi[mx],yi[mx],zi[mx];
double dist(double x1,double x2,double y1,double y2,double z1,double z2)
{
	return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) + (z1-z2)*(z1-z2);
}
double Get(double x,double y,double z)
{
	double ret = 0;
	for(int i=1;i<=n;i++){
		ret = max(ret,dist(x,xi[i],y,yi[i],z,zi[i]));
	}
	return ret;
}
double sanfen3(double x,double y)
{
	double l = -1e5,r = 1e5;
	while(l<r-eps){
		double mid = (l+r)/2;
		double mmid = (mid+r)/2;
		if(Get(x,y,mid)>Get(x,y,mmid))
		l = mid;
		else r = mmid;
	}
	return min(Get(x,y,l),Get(x,y,r));
}
double sanfen2(double x)
{
	double l = -1e5, r = 1e5;
	while(l<r-eps){
		double mid = (l+r)/2;
		double mmid = (mid+r)/2;
		if(sanfen3(x,mid)>sanfen3(x,mmid))
		l = mid;
		else r = mmid;
	}
	return min(sanfen3(x,l),sanfen3(x,r));
}
double sanfen1(double l,double r)
{
	while(l<r-eps){
		double mid = (l+r)/2;
		double mmid = (mid+r)/2;
		if(sanfen2(mid)>sanfen2(mmid))
		l = mid;
		else r = mmid;
	}
	//cout << l << " " << r << endl;
	return min(sanfen2(l),sanfen2(r));
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%lf%lf%lf",xi+i,yi+i,zi+i);
	printf("%.10lf\n",sqrt(sanfen1(-1e5,1e5))); 
	return 0;
}