HDU 2438 Turn the corner

Turn the corner

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3281    Accepted Submission(s): 1348

Problem Description

Mr. West bought a new car! So he is travelling around the city.
One day he comes to a vertical corner. The street he is currently in has a width x, the street he wants to turn to has a width y. The car has a length l and a width d.
Can Mr. West go across the corner?

Input

Every line has four real numbers, x, y, l and w.
Proceed to the end of file.

Output

If he can go across the corner, print "yes". Print "no" otherwise.

 

Sample Input

  
  

   
   10 6 13.5 4
10 6 14.5 4
  
  

 

Sample Output

  
  

   
   yes
no
  
  

题意：问汽车能否通过该弯路，可以通过输出“yes”,否则输出“no”。

思路：这道题就是一道数学题，重点是固定两点，判断第三点是否在跑道外，然后根据图列出关于角度的一个函数，然后对角度三分（因为推出的公式函数它是一个先增后减的函数，不能用二分 ，二分只适合区域确定，递增或递减的函数），角度范围是0到90度。

这道题可以任意寻找两点，公式推导如图所示

图一：

图二：

代码如下：

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <cmath>
#define pi 3.1415926
#include <algorithm>
using namespace std;	
double x,l,y,w,a,b,c;
double f(double t);
int main(){
	while(cin>>x>>y>>l>>w)
	{   a=0.0;
	    b=pi/2.0;
		double mid,mmid;
        while(b-a>1e-10){
           	mid=a+(b-a)/3.0;
		   	mmid=b-(b-a)/3.0;
		   	if(f(mid)>f(mmid))
		       b=mmid;
 	 	 	else
		       a=mid;	
        }
        if(f(a)>y)
            cout<<"no"<<endl;
        else cout<<"yes"<<endl;
				
	}
	return 0;
} 
double f(double t)
{
	return l*sin(t)+(w-x*sin(t))/(cos(t));//图一的公式
	//return l*cos(t)+(w-x*cos(t))/(sin(t));图二的公式
}