ZOJ 3203 数学问题-求导求最大值

如果L全在地面上：

输出　　h * D / H

如果L全在墙上：

输出　　h

否则：

（D - X ） / X = Y / （H - h）

L = D - X + h - Y

然后对L求导即可

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <math.h>
 4 #include <algorithm>
 5 using namespace std;
 6 
 7 int main(){
 8     double H,h,D,x,y,x0;
 9     int t;
10     scanf("%d",&t);
11     while(t--){
12         scanf("%lf%lf%lf",&H,&h,&D);
13         x0 = D - h * D / H;
14         x = sqrt( D * (H - h) );
15         y = (D - x) * (H - h) / x;
16         if(x >= D)  printf("%.3lf\n",h);
17         else if(x < x0) printf("%.3lf\n",h * D / H);
18         else    printf("%.3lf\n",h - y + D - x);
19     }
20     return 0;
21 }

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

ZOJ 3203 数学问题-求导求最大值,布布扣,bubuko.com

ZOJ 3203 数学问题-求导求最大值

原文：http://www.cnblogs.com/wushuaiyi/p/3648317.html