Weird Flecks, But OK （最小圆覆盖）

题目链接：https://ac.nowcoder.com/acm/contest/12606/A

等效为三个平面，在三个平面分别求能够覆盖所有节点的最小圆直径
参考dalao的博客：
最小圆覆盖
三角形外接圆圆心计算

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 5005;

int n;
struct Node{
    double x,y;
}a[maxn],b[maxn],c[maxn];
double x,y,z;
double ep = 2 * 1e-10;

double dis(Node a, Node b) {
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}

void find_excenter(Node a, Node b, Node c, Node &o, double &r) {
    double delt = 4 * (c.y - b.y) * (b.x - a.x) - 4 * (b.y - a.y) * (c.x - b.x);
    double dx = 2 * (c.y - b.y) * (b.x * b.x + b.y * b.y - a.x * a.x - a.y * a.y)
               -2 * (b.y - a.y) * (c.x * c.x + c.y * c.y - b.x * b.x - b.y * b.y);
    double dy =-2 * (c.x - b.x) * (b.x * b.x + b.y * b.y - a.x * a.x - a.y * a.y)
               +2 * (b.x - a.x) * (c.x * c.x + c.y * c.y - b.x * b.x - b.y * b.y);
    o.x = dx / delt, o.y = dy / delt;
    r = dis(o,a);
    return;       
}

double f(Node p[]) {
    Node o = p[1]; double r = 0;
    for(int i = 2; i <= n; ++i) {
        if(dis(o,p[i]) > r + ep) {
            o = p[i]; r = 0;
            for(int j = 1; j < i; ++j) {
                if(dis(o,p[j]) > r + ep) {
                    o.x = (p[i].x + p[j].x) / 2;
                    o.y = (p[i].y + p[j].y) / 2;
                    r = dis(p[i],p[j]) / 2;
                    for(int k = 1; k < j; ++k) {
                        if(dis(o,p[k]) > r + ep) {
                            find_excenter(p[i],p[j],p[k],o,r);
                        }
                    }
                }
            }
        }
    }
    return r * 2;
}

int main() {
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> x >> y >> z;
        a[i] = {x,y}, b[i] = {y,z}, c[i] = {z,x};
    }
    double ans = 0.0;
    ans = min(f(a),min(f(b),f(c)));
    printf("%.10lf\n",ans);
    return 0;
}