经典点到线段最短距离的问题,用向量法写的
题目链接:
zzuli-2127
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
double t,x1,y1,z1,x2,y2,z2,x0,y0,z0,x,y,z,h,i,j,xt,yt,zt,T,n;//为了方便,全部定义为了double
double d,mid,x3,y3,z3;
cin>>T;;
while(T--)
{
cin>>h>>x1>>y1>>x2>>y2;//飞船的坐标
cin>>x0>>y0>>z0>>xt>>yt>>zt;//气球起始坐标与移动速度
cin>>n;
while(n--)
{
cin>>t;
x=x0+xt*t;//t秒时坐标
y=y0+yt*t;
z=z0+zt*t;
if(x1==x2&&y1==y2)//飞船为一个点
{
d=sqrt((x-x1)*(x-x1)+(y-y1)*(y-y1)+(z-h)*(z-h));
printf("%.2f\n",d);
continue;
}
else
{
mid=((x-x1)*(x2-x1)+(y-y1)*(y2-y1))/((x1-x2)*(x1-x2)+(y2-y1)*(y2-y1));//用向量写,判断(x0,y0)点与飞船所在线段的相对位置,mid=|a|cos<a,b>/|b|
x3=x1+mid*(x2-x1);//垂足坐标
y3=y1+mid*(y2-y1);
z3=h;
if(mid>=0&&mid<=1)
{
d=sqrt((x3-x)*(x3-x)+(y3-y)*(y3-y)+(h-z)*(h-z));
printf("%.2f\n",d);
}
else if(mid>1)
{
d=sqrt((x2-x)*(x2-x)+(y2-y)*(y2-y)+(z3-z)*(z3-z));
printf("%.2f\n",d);
}
else if(mid<0)
{
d=sqrt((x1-x)*(x1-x)+(y1-y)*(y1-y)+(h-z)*(h-z));
printf("%.2f\n",d);
}
}
}
}
return 0;
}