sgu204：Little Jumper(数学分析+物理分析)

具体参考大牛博客:
http://hi.baidu.com/sabbah/item/67ceef84fa567a1ec2162744
具体为啥是个单峰函数，脑补吧(脑洞大补不出)

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const double eps = 1e-12;
double b1, t1, b2, t2, l, ds, df, g;

inline short dcmp(double k)
{
	if(fabs(k) <= eps) return 0;
	else return k>0?1:-1;	
}

double calc(double x1, double down, double up, double x2)
{
	double k = -1/x2, y = k*x1*x1+x1, Vs;
	double mid = x2*0.5;
	if(dcmp(y-down) >= 0 && dcmp(y-up) <= 0) 
	{
		double h = k*mid*mid+mid;
		double t = sqrt(2*h/g);
		double vx = mid/t, vy = g*t;
		Vs = vx*vx+vy*vy;
	}
	else
	{
		double a, b;
		if(dcmp(y-down) < 0) a = down/(x1*(x1-x2)), b = -a*x2;
		else a = up/(x1*(x1-x2)), b = -a*x2;
		double h = a*mid*mid+b*mid;
		double t = sqrt(2*h/g);
		double vx = mid/t, vy = g*t;
		Vs = vx*vx+vy*vy;
	}
	return Vs;
}

double check(double mid)
{
	double x = calc(ds, b1, t1, mid+ds), y = calc(l-mid, b2, t2, l-mid+df);
	return max(x, y);	
}

int main()
{
	while(~scanf("%lf%lf%lf%lf%lf%lf%lf%lf", &b1, &t1, &b2, &t2, &l, &ds, &df, &g))
	{
		double left = 0, right = l;
		while(dcmp(right-left) > 0)
		{
			double mid1 = (right-left)/3+left, mid2 = (right-left)*2/3+left;
			double a = check(mid1), b = check(mid2);
			if(dcmp(a-b) < 0) right = mid2;
			else left = mid1;
		}
		printf("%.4lf\n", sqrt(check((left+right)*0.5)));
	}
	return 0;	
}