LightOJ-1062-bindary search

题目大意：给定x,y,c，求街道的长度；

题目解析：初看应该是个平面几何的题目，里面肯定要根据相似三角形来列出等式从而求出街道的长度；不难求出等式pow(x*x-a*a,0.5))+1.0/(pow(y*y-a*a,0.5）=1/c;发现等式左边是个单调函数，所以很简单就想到要二分；

AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
double x,y,c;
int judge(double a)
{
	double ans=1.0/(pow(x*x-a*a,0.5))+1.0/(pow(y*y-a*a,0.5));
	if(ans>=1.0/c)	return 0;
	return 1;		
}
int main()
{
	int cas,cc;
	scanf("%d",&cas);
	for(cc=1;cc<=cas;cc++)
	{
		scanf("%lf %lf %lf",&x,&y,&c);
		double l=0,r;
		if(x<y)
			r=x;
		else 
			r=y;
		while(r-l>=0.0000001)
		{
			double mid=(l+r)/2;
			//cout<<mid<<endl;
			if(judge(mid)>0)
				l=mid;
			else 
				r=mid;
		}
		printf("Case %d: %.12lf\n",cc,l);
	}
	return 0;
}