题后反思:复杂的问题总是可以考虑最简单的情况再加以变形,本题正是建立在解决简单的问题之上的,两条线段问最大距离-最小距离无疑是简单的,考察端点即可。而折线段恰好可以分解为多个线段,问题得以解决。
#include<bits/stdc++.h>
using namespace std;
struct Point
{
double x,y;
Point(double x=0,double y=0):x(x),y(y){ }
};
typedef Point Vector;
const int maxn = 60;
int T,A,B,x,y;
double Min,Max;
Point P[maxn],Q[maxn];
const double eps=1e-10;
double Cross(Vector A,Vector B)
{
return A.x*B.y-A.y*B.x;
}
int dcmp(double x)
{
if(fabs(x)<eps) return 0;
else return x<0 ? -1 : 1;
}
Vector operator + (Vector A,Vector B)
{
return Vector(A.x+B.x,A.y+B.y);
}
Vector operator -(Vector A,Vector B)
{
return Vector(A.x-B.x,A.y-B.y);
}
Vector operator *(Vector A,double p)
{
return Vector(A.x*p,A.y*p);
}
Vector operator /(Vector A,double p)
{
return Vector(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 Dot(Vector A,Vector B)
{
return A.x*B.x+A.y*B.y;
}
double Length(Vector A)
{
return sqrt(Dot(A,A));
}
double DistanceTosegment(Point P,Point A,Point B)
{
if(A==B) return Length(P-A);
Vector v1=B-A,v2=P-A,v3=P-B;
if(dcmp(Dot(v1,v2))<0) return Length(v2);
else if(dcmp(Dot(v1,v3)>0)) return Length(v3);
else return fabs(Cross(v1,v2))/Length(v1);
}
void update(Point P,Point A,Point B)
{
Min=min(Min,DistanceTosegment(P,A,B));
Max=max(Max,Length(P-A));
Max=max(Max,Length(P-B));
}
Point read_point()
{
int x,y;
scanf("%d %d",&x,&y);
return Vector(x,y);
}
int main()
{
scanf("%d",&T);
for(int kase=1;kase<=T;kase++)
{
scanf("%d %d",&A,&B);
for(int i=0;i<A;i++) P[i]=read_point();
for(int j=0;j<B;j++) Q[j]=read_point();
double LenA=0,LenB=0;
for(int i=0;i<A-1;i++) LenA+=Length(P[i+1]-P[i]);
for(int j=0;j<B-1;j++) LenB+=Length(Q[j+1]-Q[j]);
int Sa=0,Sb=0;
Point Pa=P[0],Pb=Q[0];
Min=1e9,Max=-1e9;
while(Sa<A-1&&Sb<B-1)
{
double La=Length(P[Sa+1]-Pa);
double Lb=Length(Q[Sb+1]-Pb);
double T=min(La/LenA,Lb/LenB);
Vector Va=(P[Sa+1]-Pa)/La*T*LenA;
Vector Vb=(Q[Sb+1]-Pb)/Lb*T*LenB;
update(Pa,Pb,Pb+Vb-Va);
Pa=Pa+Va;//A的位移向量
Pb=Pb+Vb;//B的位移向量
if(Pa==P[Sa+1]) Sa++;
if(Pb==Q[Sb+1]) Sb++;
}
printf("Case %d: %.0lf\n",kase,Max-Min);
}
return 0;
}