ZOJ 3203 Light Bulb 基本不等式

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

题目意思是让我们求在灯泡的照射下，人在地上的影子和在墙上的影子总长度最长的L。

解题思路：设地上影子长度为x，墙上影子长度为y,利用相似三角形法则，不难得出一个L的一个表达式，L = y + (h-y)*D / (H-y),而通过变形则可以得到D+H-(H-y+(H-h)/(H-y)),然后用基本不等式就不难得出答案了，需要注意的是边界情况不能取到，墙上的影子长度不可能大于h，也不可能出现负值。

代码实现：

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int T;
	cin>>T;
	double H,h,D,x,y;
	while(T--)
	{
		cin>>H>>h>>D;
		y = H - sqrt(D*(H-h));
		if(y > h)	y = h;//边界值特殊处理 
		if(y < 0)	y = 0;
		x = (h-y)/(H-y)*D;
		printf("%.3f\n",x+y);
	}
}