hdu_4355_三分_学习笔记

三分求解的问题:
一元二次方函数图形的极值,或者解的分布类似于一元二次方函数图形的样子.
凸的和凹的处理是不一样的
1. 如果f(mid) > f(mmid)可推出 ans在mmid 的左边
2. 如果f(mid) < f(mmid)可推出 ans在mid 的右边

原因看图

凹就反过来
例题 hud 4355
Party All the Time

In the Dark forest, there is a Fairy kingdom where all the spirits will go together and Celebrate the harvest every year. But there is one thing you may not know that they hate walking so much that they would prefer to stay at home if they need to walk a long way.According to our observation,a spirit weighing W will increase its unhappyness for S3*W units if it walks a distance of S kilometers.
Now give you every spirit’s weight and location,find the best place to celebrate the harvest which make the sum of unhappyness of every spirit the least.
Input
The first line of the input is the number T(T<=20), which is the number of cases followed. The first line of each case consists of one integer N(1<=N<=50000), indicating the number of spirits. Then comes N lines in the order that x[i]<=x[i+1] for all i(1<=i

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<algorithm>
#include<cmath>
typedef long long ll;
using namespace  std;
#define eps 1e-6
double x[55555],w[55555];
int n;
double equ(double s)
{
    double ans=0;
    for(int i=0;i<n;i++)
    {
        double ss=fabs(s-x[i]);
        ans+=ss*ss*ss*w[i];
    }
    return ans;
}
double solve(double l,double r)
{
    while(r-l>eps)
    {
        double ll=l+(r-l)/3;
        double rr=r-(r-l)/3;
        if(equ(ll)>equ(rr))
            l=ll;
        else
            r=rr;
    }
    return equ(l);
}
int main()
{
    int t,i,j;
    while(cin>>t)
    {
        for(int c=1;c<=t;c++)
        {
            cin>>n;
            for(i=0;i<n;i++)
               scanf("%lf%lf",&x[i],&w[i]);
            double l=x[0],r=x[n-1];
            double ans=solve(l,r);
            printf("Case #%d: %.0lf\n",c,ans);
        }
    }
    return 0;
}