Light Bulb+ZOJ+三分搜索

Light Bulb

---

Time Limit: 1 Second       Memory Limit: 32768 KB

---

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 10³, 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

解决方案：基本很裸的三分搜索，人从0到D，影子有一个从小到大在从大到小的过程，所以求凸函数的极值。

code：
#include<iostream>
#include<cstdio>
using namespace std;
double H,h,D;
double cal(double s)
{

    double l=(s*h)/(H-h);
    if(l>(D-s))
    {
        l=(l-(D-s))*(H-h)/s;
        return (D-s+l);
    }
    return l;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf%lf%lf",&H,&h,&D);
        double left=0.0,right=D,mid,midmid;
        double midl,midmidl;
        while((right-left)>0.00000001)
        {
            mid=(left+right)/2.0;
            midmid=(mid+right)/2.0;
            midl=cal(mid);
            midmidl=cal(midmid);
            if(midl>=midmidl)
            {
                right=midmid;
            }
            else left=mid;
        }
        printf("%.3lf\n",cal(right));
    }
    return 0;
}