HDU Line belt

第一次做三分题...参考http://hi.baidu.com/czyuan_acm/blog/item/8cc45b1f30cefefde1fe0b7e.html

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
struct pp
{
	double x,y;
}a,b,c,d;
int p,q,r;
double dis(pp a,pp b)
{
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
double fy(pp c,pp d,pp x)
{
	pp mid1,mid2,left,right;
	double t1=1,t2=0;
	left=c;
	right=d;
	while(fabs(t1-t2)>0.000001)
	{
		mid1.x=(left.x+right.x)/2;
		mid1.y=(left.y+right.y)/2;
		mid2.x=(mid1.x+right.x)/2;
		mid2.y=(mid1.y+right.y)/2;
		t1=dis(mid1,x)/r+dis(mid1,d)/q;
		t2=dis(mid2,x)/r+dis(mid2,d)/q;
		if(t1<t2)
			right=mid2;
		else
			left=mid1;
	}
	return t1;
}
double fx(pp a,pp b,pp c,pp d)
{
	pp mid1,mid2,left,right;
	double t1=1,t2=0;
	left=a;
	right=b;
	while(fabs(t1-t2)>0.000001)
	{
		mid1.x=(left.x+right.x)/2;
		mid1.y=(left.y+right.y)/2;
		mid2.x=(mid1.x+right.x)/2;
		mid2.y=(mid1.y+right.y)/2;
		t1=dis(mid1,a)/p+fy(c,d,mid1);
		t2=dis(mid2,a)/p+fy(c,d,mid2);
		if(t1<t2)
			right=mid2;
		else
			left=mid1;
	}
	return t1;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y,&d.x,&d.y);
		scanf("%d%d%d",&p,&q,&r);
		printf("%.2f\n",fx(a,b,c,d));
	}
	return 0;
}