Country Meow Gym - 101981D （最小覆盖球， 爬山法）

#include <bits/stdc++.h>

using namespace std;
typedef double db;
const int N = 1e5+ 10;
struct node
{
    db x, y, z;
}q[N];
db r = 1e8;
int n;
double get_dist(node a, node b)
{
    db dx = a.x - b.x, dy = a.y - b.y, dz = a.z - b.z;
    return dx * dx + dy * dy + dz * dz;
}

int get_pos(node p)
{
    int ans = 0;
    db r_max = -1;
    for(int i = 1; i <= n; i++)
    {
        double tmp = get_dist(q[i], p);
        if(tmp > r_max)
        {
            ans = i;
            r_max = tmp;
        }
    }
    r = min(r, r_max);
    return ans;
}

void simulate_anneal()
{
    node cur= {0, 0, 0};
    for(db i = 1; i > 1e-11; i *= 0.996)
    {
        int pos = get_pos(cur);
//        cout << pos << " " << r << endl;
        cur.x = cur.x + (q[pos].x - cur.x) * i;
        cur.y = cur.y + (q[pos].y - cur.y) * i;
        cur.z = cur.z + (q[pos].z - cur.z) * i;
    }
}
int main()
{
    srand((unsigned)time(NULL));
    while(~scanf("%d", &n))
    {
        r = 1e11;
        for(int i = 1; i <= n; i ++)
        {
            scanf("%lf%lf%lf", &q[i].x, &q[i].y, &q[i].z);
        }
        simulate_anneal();
        printf("%.9lf\n", sqrt(r));
    }

}