zoj3716

#include<iostream>#include<cstdio>#include<list>#include<algorithm>#include<cstring>#include<string>#include<queue>#include<stack>#include<map>#include<vector>#include<cmath>#include<memory.h>#define ll long long#define LL __int64using namespace std;double dis(double a,double b,double c,double d){return sqrt((a-c)*(a-c)*1.0+(b-d)*(b-d)*1.0);}bool cmp(double x,double y){return x<y;}int main(){int x1,y1,x2,y2,x3,y3,x4,y4;double r=0.0;double a[100];while(scanf("%d %d %d %d %d %d %d %d",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4)!=EOF){r=0.0;a[0]=dis(x1*1.0,y1*1.0,x2*1.0,y2*1.0);//这里写撮了，因为一开始思路错了，改来改去改的a[1]=dis(x1*1.0,y1*1.0,x3*1.0,y3*1.0);a[2]=dis(x1*1.0,y1*1.0,x4*1.0,y4*1.0);a[3]=dis(x2*1.0,y2*1.0,x3*1.0,y3*1.0);a[4]=dis(x2*1.0,y2*1.0,x4*1.0,y4*1.0);a[5]=dis(x3*1.0,y3*1.0,x4*1.0,y4*1.0);double temp=min(a[0]+a[5],a[1]+a[4]);double ans=min(temp,a[2]+a[3]);printf("%.6lf\n",ans);}return 0;}