Dog Distance - UVa 11796 几何

题意：给你两条狗的行走路径，然后他们同时开始同时到达，问他们之间距离的最大值和最小值之差是多少。

思路：首先每次从当前状态到有一只狗到达一个点的时候为止，这段时间内，可以知道两条狗的开始位置和位移状态，假设A不动，然后求一个点到线段的最小值，就是这段时间内的最短距离。最长距离就是这段时间内开始和结束时的最大距离。

AC代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
struct Point
{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y){}
};
typedef Point Vector;
double eps=1e-10;
int dcmp(double x)
{
    if(fabs(x)<eps)
      return 0;
    return x<0 ? -1 : 1 ;
}
Point operator +(Point A,Point B){return Point(A.x+B.x,A.y+B.y);}
Point operator -(Point A,Point B){return Point(A.x-B.x,A.y-B.y);}
Point operator *(Point A,double p){return Point(A.x*p,A.y*p);}
Point operator /(Point A,double p){return Point(A.x/p,A.y/p);}
bool  operator== ( const Point &A,const Point &B) { return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;}
double dis(Point A,Point B){return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));}
double Cross(Point A,Point B){return A.x*B.y-A.y*B.x;}
double Dot(Point A,Point B){return A.x*B.x+A.y*B.y;}
double Length(Vector A){return sqrt(Dot(A,A));}
double DistanceToLine(Point P,Point A,Point B)
{
    Vector v1=B-A,v2=P-A;
    return fabs(Cross(v1,v2)/Length(v1));
}
double DistanceToSegment(Point P,Point A,Point B)
{
    if(A==B)  return Length(P-A);

    Vector v1=B-A;
    Vector v2=P-A;
    Vector v3=P-B;

    if(dcmp(Dot(v1,v2))==-1)    return  Length(v2);
    else if(Dot(v1,v3)>0)    return Length(v3);

    else return DistanceToLine(P, A, B);

}
Point p1[60],p2[60],A,B,Va,Vb;
double sum1[60],sum2[60],v1,v2,minn,maxn,s1,s2,tim,t1,t2,temp,ret;
int T,t,n,m;
void update(Point A,Point B,Point C)
{
    minn=min(minn,DistanceToSegment(A,B,C));
    maxn=max(maxn,dis(A,B));
    maxn=max(maxn,dis(A,C));
}
int main()
{
    int i,j,k,a,b;
    scanf("%d",&T);
    for(t=1;t<=T;t++)
    {
        scanf("%d%d",&n,&m);
        for(i=1;i<=n;i++)
            scanf("%lf%lf",&p1[i].x,&p1[i].y);
        for(i=2;i<=n;i++)
            sum1[i]=sum1[i-1]+dis(p1[i],p1[i-1]);
        for(i=1;i<=m;i++)
            scanf("%lf%lf",&p2[i].x,&p2[i].y);
        for(i=2;i<=m;i++)
            sum2[i]=sum2[i-1]+dis(p2[i],p2[i-1]);
        v1=sum1[n];v2=sum2[m];
        a=1;b=1;
        A=p1[1];B=p2[1];
        minn=maxn=dis(A,B);
        s1=s2=0;
        while(true)
        {
            if(a==n && b==m)
              break;
            tim=min((sum1[a+1]-s1)/v1,(sum2[b+1]-s2)/v2);
            Va=(p1[a+1]-p1[a])*v1*tim/(sum1[a+1]-sum1[a]);
            Vb=(p2[b+1]-p2[b])*v2*tim/(sum2[b+1]-sum2[b]);
            update(A,B,B+Vb-Va);
            A=A+Va;
            B=B+Vb;
            s1+=tim*v1;
            s2+=tim*v2;
            if(dcmp(s1-sum1[a+1])>=0)
              a++;
            if(dcmp(s2-sum2[b+1])>=0)
              b++;
        }
        printf("Case %d: %.0f\n",t,maxn-minn+eps);
    }
}