题目:点击打开链接
题意:给n个点的坐标(xi,yi,zi),求覆盖这n个点的最小球的半径r。
分析:最小球覆盖模板题,模拟退火或者三分套三分再套三分,模拟退火法就是纯贪心的修改版。在搜索到某个局部最优解之后,普通的贪心算法就结束搜索了,但是模拟退火法会以一定的概率进行下一次搜索,这个概率随着时间的变化而减小。选择任意一个点作为初始解,然后将所有点按到当前圆/球心的距离排序,向距离最远的点靠近。每次靠近的距离都会减小(相当于模拟退火法的概率逐渐减小),最后圆/球心原来越靠近最优解,半径趋近稳定。参考博客https://doowzs.com/tag/%E6%A8%A1%E6%8B%9F%E9%80%80%E7%81%AB%E6%B3%95/。
代码:
///#pragma comment(linker, "/STACK:102400000,102400000")
///#include<unordered_map>
///#include<unordered_set>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<iomanip>
#include<string>
#include<cstdio>
#include<bitset>
#include<vector>
#include<cctype>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<set>
#include<map>
using namespace std;
#define pt(a) cout<<a<<endl
#define debug test
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define inf 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
const ll mod = 1e9+7;
const int N = 40;
ll qp(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
int to[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int n;
struct P{
double x,y,z;
}s,p[N];
double delta,ans;
double dis(P a,P b) {
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));
}
void sa() {
s.x=s.y=s.z=0;
delta=100,ans=1e20;
///delta增大可以提高精度
while(delta>eps) {
int d=1;
for(int i=2;i<=n;i++)
if(dis(s,p[i])>dis(s,p[d])) d=i;
double md=dis(s,p[d]);
ans=min(ans,md);
s.x+=(p[d].x-s.x)/md*delta;
s.y+=(p[d].y-s.y)/md*delta;
s.z+=(p[d].z-s.z)/md*delta;
delta*=0.98;
}
cout<<fixed<<setprecision(5)<<ans<<endl;
}
int main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
while(cin>>n&&n) {
for(int i=1;i<=n;i++) cin>>p[i].x>>p[i].y>>p[i].z;
sa();
}
return 0;
}