牛客寒假集训营 牛牛战队的比赛地

题目传送门

---

我好菜，什么题都看不出算法，到了别人那什么都是板子题T_T

---

三分板子（强行板子、假装大佬）题：

struct node
{
    double x, y;
} p[100010];
int n;
double check(double a)
{
    double res = 0;
    for (int i = 1; i <= n; i++)
        res = max(res, sqrt((p[i].x - a) * (p[i].x - a) + p[i].y * p[i].y));
    return res;
}
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> p[i].x >> p[i].y;
    double mid = 0, l, r, midr;
    l = -10010, r = 10010;
    while (fabs(l - r) >= 0.000000001)
    {
        mid = (l + r) / 2;
        midr = (mid + r) / 2;
        if (check(mid) >= check(midr))
            l = mid;
        else
            r = midr;
    }
    printf("%.10f\n", check(midr));
    return 0;
}