https://cn.vjudge.net/problem/Gym-101981D
模拟退火步长更新是差值加delt的k次方。
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-3
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int N=2e6+9;
const int M=4e5+9;
double delt=0.98;
double T=1000;
int n;
struct point
{
double x,y,z;
}p[N];
double dis(point a,point 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));
}
double solve()
{
double step=T;
point tmp;
tmp.x=0;
tmp.y=0;
tmp.z=0;
double ans=1e50;
while(step>eps)
{
point Max=p[1];
for(int i=2;i<=n;i++)
{
if(dis(tmp,p[i])>dis(tmp,Max))
Max=p[i];
}
ans=min(ans,dis(tmp,Max));
tmp.x+=(Max.x-tmp.x)*(step/T);
tmp.y+=(Max.y-tmp.y)*(step/T);
tmp.z+=(Max.z-tmp.z)*(step/T);
step*=delt;
}
return ans;
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
sfi(n);
for(int i=1;i<=n;i++)
{
scanf("%lf%lf%lf",&p[i].x,&p[i].y,&p[i].z);
}
printf("%.15lf\n",solve());
return 0;
}