编程之美2013 集会

三分题目，比较简单：

代码如下：

#include <iostream>
#include <cstdio>
#include <cmath>
#define maxn 50007
#define eps 0.0000009
using namespace std;


double d[maxn][2];
int n;


int main()
{
    int ca, w, i;
    double a, l, r, t1, t2, mid1, mid2;
    cin >> ca;
    for ( w = 1 ; w <= ca; w++ )
    {
        scanf( "%d", &n );
        l = 99999999999; r = -l;
        for ( i = 0; i < n; i++ )
        {
            scanf( "%lf%lf", &d[i][0], &d[i][1] );
            d[i][1] *= d[i][1];
            if ( l > d[i][0] ) l = d[i][0];
            if ( r < d[i][0] ) r = d[i][0];
        }
        //printf( "%lf %lf\n", l, r);
        while ( r-l >= eps )
        {
            mid1 = l+(r-l)/3;
            mid2 = r-(r-l)/3;
            t1 = t2 = 0;
            for ( i = 0 ; i < n ; i++ )
            {
                a = (d[i][0]-mid1)*(d[i][0]-mid1)+d[i][1];
                if ( a > t1 ) t1 = a;
                a = (d[i][0]-mid2)*(d[i][0]-mid2)+d[i][1];
                if ( a > t2 ) t2 = a;
            }
            if ( t1 > t2 ) l = mid1;
            else r = mid2;
        }
        printf( "Case #%d: %.6llf\n", w, r);
    }
}