题目链接:http://hihocoder.com/problemset/problem/1142
题意:
求抛物线到某个点的最短距离。
分析:
求解距离,不断得三分逼近。
//题目:hihocoder 1142
//时间:2015-4-13 22:00
//作者:Miki
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
const double eps=1e-9;
double a,b,c,x,y;
double dis(double x1,double y1,double x2,double y2)
{
return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
//计算距离
double Calc(double xx)
{
double yy=a*xx*xx+b*xx+c;
return dis(xx,yy,x,y);
}
double Solve()
{
//三分
double Left, Right;
double mid, midmid;
double mid_value, midmid_value;
Left = -200; Right = 200;
while (Left + eps < Right)
{
mid = (Left + Right) /2.0;
midmid = (mid + Right) /2.0;
mid_value = Calc(mid);
midmid_value = Calc(midmid);
if (mid_value < midmid_value)
Right= midmid;
else
Left = mid;
}
return midmid_value;
}
int main()
{
// freopen("in.txt","r",stdin);
while(scanf("%lf %lf %lf %lf %lf",&a,&b,&c,&x,&y)!=EOF)
{
printf("%.3lf\n",Solve());
}
return 0;
}