hdu 1392凸包周长 (三)
break;
for(int i = 0; i < N; i++)
{
cin>>Points[i].x>>Points[i].y;
}
Graham_Scan();
double length = 0;
for(int i = 0; i <= top - 2; i++)
{
length +=Point::dis(Points[stack[i]],Points[stack[i+1]]);
}
length +=Point::dis(Points[stack[top - 1]],Points[stack[0]]);
if(N == 1)
printf("0.00\n");
else if(N == 2)
printf("%.2lf\n",Point::dis(Points[0],Points[1]));
else
printf("%.2lf\n",length);
}
return 0;
}