http://www.bianchengla.com/oj/1/practise/problem?id=1033
这道题是一道比较简单的题目,本来可以使用判断角度的问题进行解题的,但是今天看到三分查找的时候看到了这个题目,所以就拿这道题目来练练手,比较简单。
题目意思是求三维空间中一点到一条线段的最短距离。
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
struct point
{
double x,y,z;
}a,b,p;
double max(double a,double b)
{
if(a>b) return a;
return b;
}
double min(double a,double b)
{
if(a>b) return b;
return a;
}
double dist(point a,point b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));
}
double cal(point mid)
{
return dist(mid,p);
}
int main()
{
int t;
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
cin>>p.x>>p.y>>p.z>>a.x>>a.y>>a.z>>b.x>>b.y>>b.z;
point low=a,high=b,mid,midmid;
//double low=0,high=dist(a,b);
double mid_value,midmid_value;
while(dist(low,high)>1e-7)
{
mid.x=(low.x+high.x)/2,mid.y=(low.y+high.y)/2,mid.z=(low.z+high.z)/2;
midmid.x=(mid.x+high.x)/2,midmid.y=(mid.y+high.y)/2,midmid.z=(mid.z+high.z)/2;
mid_value=cal(mid);
midmid_value=cal(midmid);
if(mid_value<midmid_value)
high=midmid;
else low=mid;
}
printf("Case %d: %.2lf\n",i,cal(low));
}
return 0;
}