HDU 4355 (三分)

Party All the Time

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
const int N=50005;
typedef long long ll;
const double eps=1e-7;
double a[N];
double b[N];
int n;
double check(double mid)
{
    double s=0;
    for(int i=1; i<=n; i++)
    {
//        s+=fabs((a[i]-mid)*(a[i]-mid)*(a[i]-mid)*b[i]);
        s+=abs((a[i]-mid)*(a[i]-mid)*(a[i]-mid)*b[i]);//这里不能用pow，不然会超时
    }
    return s;
}
int main()
{
    int T;
    scanf("%d",&T);
    int Case=0;
    while(T--)
    {
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            scanf("%lf%lf",&a[i],&b[i]);
        }
        double l=-1e6,r=1e6;
        while(r-l>=eps)
        {
            double midl=(l+r)/2.0;
            double midr=(midl+r)/2.0;
            if(check(midl)+eps<check(midr))r=midr;
            else l=midl;
        }
        printf("Case #%d: %.0lf\n",++Case,check(l));
    }

    return 0;
}