HDU2298 Toxophily

本文版权归ljh2000和博客园共有，欢迎转载，但须保留此声明，并给出原文链接，谢谢合作。

本文作者：ljh2000
作者博客：http://www.cnblogs.com/ljh2000-jump/
转载请注明出处，侵权必究，保留最终解释权！

Problem Description

The recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climbing, and so on.
We all like toxophily.

Bob is hooked on toxophily recently. Assume that Bob is at point (0,0) and he wants to shoot the fruits on a nearby tree. He can adjust the angle to fix the trajectory. Unfortunately, he always fails at that. Can you help him?

Now given the object's coordinates, please calculate the angle between the arrow and x-axis at Bob's point. Assume that g=9.8N/m.

 

Input

The input consists of several test cases. The first line of input consists of an integer T, indicating the number of test cases. Each test case is on a separated line, and it consists three floating point numbers: x, y, v. x and y indicate the coordinate of the fruit. v is the arrow's exit speed.
Technical Specification

1. T ≤ 100.
2. 0 ≤ x, y, v ≤ 10000. 

 

Output

For each test case, output the smallest answer rounded to six fractional digits on a separated line.
Output "-1", if there's no possible answer.

Please use radian as unit.

Sample Input

3
0.222018 23.901887 121.909183
39.096669 110.210922 20.270030
138.355025 2028.716904 25.079551

 

Sample Output

1.561582
-1
-1

 

 

正解：三分

解题报告：

　　居然是我写的第一道三分的题目，我好菜啊...

　　根据高一物理知识，高度关于角度显然是一个单峰函数，那么我们可以通过三分来得到最高高度，如果最高高度都达不到y那么就是-1.（要用到一点高一的物理...）

　　接着我们可以在我们取到最高高度的角度和0之间二分，得到最接近y的角度.

　　总结起来就是一句话：二分用于有单调性的函数或者区间，三分用于单峰函数求最值

 

 

 //It is made by ljh2000
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <cstdio>
 #include <cmath>
 #include <algorithm>
 #include <ctime>
 #include <vector>
 #include <queue>
 #include <map>
 #include <set>
 using namespace std;
 typedef long long LL;
 const int inf = (<<);
 const double pi = acos(-);
 const double eps = 1e-;
 const double g = 9.80;
 double X,Y,V,L,ans;

 inline int getint()
 {
     int w=,q=; char c=getchar();
     while((c<'' || c>'') && c!='-') c=getchar(); if(c=='-') q=,c=getchar();
     while (c>='' && c<='') w=w*+c-'', c=getchar(); return q ? -w : w;
 }

 inline double cal(double o){
     double vx,vy; vx=V*cos(o); vy=V*sin(o);
     double tim=X/vx; double H=vy*tim-g*tim*tim/2.0;
     return H;
 }

 inline void three_div(){
     double l=,r=pi/2.0,mm,mid;
     while(r-l>eps) {
     mm=l+(r-l)/; mid=mm+(r-l)/;
     if(cal(mm)>cal(mid)) r=mid;
     else l=mm;
     }
     L=l;
 }

 inline void work(){
     int T=getint(); double l,r,mid;
     while(T--) {
     cin>>X>>Y>>V; three_div();
     if(cal(L)<Y) { printf("-1\n"); continue; }
     if(fabs(cal(L)-Y)<=eps) { printf("%.6lf\n",L); continue; }
     l=; r=L;
     while(r-l>eps) {
         mid=(l+r)*0.5;
         if(cal(mid)<Y) l=mid,ans=mid;
         else r=mid;
     }
     printf("%.6lf\n",ans);
     }
 }

 int main()
 {
     work();
     return ;
 }