zoj3203 Light Bulb(三分)

Problem Description

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 whileh 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, andH - 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=地上的+墙上的。当影子头部恰好在墙角时最长，故是凸函数，先增大后减小。设墙上的影长为x从光线照到墙上的点做水平线即得公式，这样一来墙上有和没有都包含了。
#include<cstdio>
#include<cmath>
#define eps 1e-6
double H,h,D;
double f(double x)
{
	return (h-x)*D/(H-x)+x;
}
int main()
{
	int t;
	double r,l,mid1,mid2,x1,x2;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lf%lf%lf",&H,&h,&D);
		l=0;
		r=h;
		while(r-l>eps)
		{
			mid1=(r+l)/2;
			mid2=(mid1+r)/2;
			if(f(mid2)<f(mid1))
				r=mid2;
			else
				l=mid1;
		}
		printf("%.3f\n",f(l));
	}
	return 0;
}