Light Bulb (三分)

Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house, thinking of how to earn more money. One day, he found that the length of his shadow was changing from time to time while walking between the light bulb and the wall of his house. A sudden thought ran through his mind and he wanted to know the maximum length of his shadow.

 

Input

The first line of the input contains an integer T (T <= 100), indicating the number of cases.

Each test case contains three real numbers H, h and D in one line. H is the height of the light bulb while h is the height of mildleopard. D is distance between the light bulb and the wall. All numbers are in range from 10-2 to 103, both inclusive, and H - h >= 10-2.

Output

For each test case, output the maximum length of mildleopard's shadow in one line, accurate up to three decimal places..

Sample Input

3
2 1 0.5
2 0.5 3
4 3 4
Sample Output
1.000
0.750
4.000

求人从左向右走动时，影子的长度L的最大值

人在灯下的影子长度是0，这时他如果向前走的话，影子会逐渐变长，到最后人走到墙的位置的时候，影长度便是人的身高了，所以影长的变化曲线要么是单调递增的,要么是向上凸的，所以适合三分。（二分法作为分治中最常见的方法，适用于单调函数，逼近求解某点的值，当函数是凸性函数时，就得用三分）。

由于影长从灯下0一直到恰好没投影到墙上的过程是一个单调的过程，我们可以把这段忽略，直接求解，投影到墙上后，影长的变化即可。

 

来一个double型的三分模板

const double EPS=1e-10;
double calc(double n)
{
    return   ;//需要自己按实际情况填写
}
double solve(double L,double R)
{
    double M,RM;
    while(L+EPS<R)
    {
        M=(L+R)/2;
        RM=(M+R)/2;
        if(calc(M)<calc(RM))//计算最小值 最大值改符号
            R=RM;
        else
            L=M;
    }
    return L;
}

 

AC代码：

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;
const double EPS=1e-9;
double H,h,D;
double calc(double n)
{
    return D-n+H-(H-h)*D/n;
}
double solve(double L,double R)
{
    double M,RM;
    while(L+EPS<R)
    {
        M=(L+R)/2;
        RM=(M+R)/2;
        if(calc(M)>calc(RM))
            R=RM;
        else
            L=M;
    }
    return calc(M);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf%lf%lf",&H,&h,&D);
        printf("%.3lf\n",solve((H-h)*D/H,D));//最短与最长
    }

    return 0;
}