hdu 4355 Party All the Time

//模版题，三分法

#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const double EPS=1e-8;
struct node{
    double x, w;
}p[50005];
int n;
double Calc(double t){
    double ret=0;
    for(int i=0; i<n; i++){
        ret+=fabs(p[i].x-t)*fabs(p[i].x-t)*fabs(p[i].x-t)*p[i].w;
    }
    return ret;
}

double Solve()
{
    double Left, Right;
    double mid, midmid;
    double mid_area, midmid_area;
    Left = -1000000; Right = 1000000;
    while (Left + EPS < Right)        //EPS为精度，搜寻范围left到right
    {
        mid = (Left + Right) / 2;
        midmid = (mid + Right) / 2;
        mid_area = Calc(mid);
        midmid_area = Calc(midmid);
        // 假设求解最大极值.    //如果求最小极值下句判断改为<
        if (mid_area < midmid_area) Right = midmid;
        else Left = mid;
    }
    return Left;
}

int main(){
    //freopen("1.txt", "r", stdin);
    int T, i, cas=1;
    scanf("%d", &T);
    while(T--){
        scanf("%d", &n);
        for(i=0; i<n; i++){
            scanf("%lf%lf", &p[i].x, &p[i].w);
        }
        printf("Case #%d: %d\n", cas++, (int)(Calc(Solve())+0.5));
    }
    return 0;
}