HDU 3007 【随机增量法】

题目大意：给定平面上 n 个点，求最小圆覆盖

我就是抄了个板而已…

---

Q:为什么是 $O(n)$ 的
A:（摇头摇头摇头
Q:三角形外心怎么求
A:不知道…
Q:学这个有什么用
A:（一脸懵逼
Q:怎么什么都不知道→→
A:窝弱嘛TAT

---

怎么觉得自己又抽了=。=

三角形外心 (我知道泥萌都会。。。
因为到各点距离相等，有

$$(x_1 - x)^2 - (y_1 - y)^2 = (x_2 - x)^2 + (y_2 - y)^2 \\ (x_2 - x)^2 + (y_2 - y)^2 = (x_3 - x)^2 + (y_3 - y)^2$$
化简得到 $$2(x_2 - x_1)x + 2(y_2 - y_1)y = x_2^2 + y_2^2 - x_1^2 - y_1^2 \ \ \ / \ \ \ A_1x + B_1y = C_1\\ 2(x_3 - x_2)x + 2(y_3 - y_2)y = x_3^2 + y_3^2 - x_2^2 - y_2^2 \ \ \ / \ \ \ A_2x + B_2y = C_2$$
有 $$\begin{cases} x = \frac {C_1B_2 - C_2B_1}{A_1B_2 - A_2B_1}\\ y = \frac {A_1C_2 - A_2C_1}{A_1B_2 - A_2B_1} \end{cases}$$

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define D double
#define N 505
#define pf(x) (x * x)
using namespace std;

int n;D r;
struct point{D x,y;}e[N],ans;

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

point center(point a,point b,point c)
{
    D A1 = (b.x - a.x) * 2,B1 = (b.y - a.y) * 2,C1 = pf(b.x) + pf(b.y) - pf(a.x) - pf(a.y);
    D A2 = (c.x - b.x) * 2,B2 = (c.y - b.y) * 2,C2 = pf(c.x) + pf(c.y) - pf(b.x) - pf(b.y);
    return (point){(C1 * B2 - C2 * B1) / (A1 * B2 - A2 * B1),
                   (A1 * C2 - A2 * C1) / (A1 * B2 - A2 * B1)};
}

void mcc()
{
    random_shuffle(e + 1,e + n + 1);
    ans = e[1],r = 0;
    for (int i = 2;i <= n;i ++)
        if (dis(ans,e[i]) > r)
        {
            ans = e[i],r = 0;
            for (int j = 1;j < i;j ++)
                if (dis(ans,e[j]) > r)
                {
                    ans.x = (e[i].x + e[j].x) / 2.;
                    ans.y = (e[i].y + e[j].y) / 2.;
                    r = dis(ans,e[j]);
                    for (int k = 1;k < j;k ++)
                        if (dis(ans,e[k]) > r)
                        {
                            ans = center(e[i],e[j],e[k]);
                            r = dis(ans,e[i]);
                        }
                }

        }
}

int main()
{
    while (scanf("%d",&n) && n)
    {
        for (int i = 1;i <= n;i ++)
            scanf("%lf%lf",&e[i].x,&e[i].y);
        mcc();
        printf("%.2f %.2f %.2f\n",ans.x,ans.y,r);
    }

    return 0;
}