1392 - Surround the Trees

凸包裸题。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<queue>
using namespace std;
#define rep(i,j,k) for(i=j;i<=k;++i)
#define per(i,j,k) for(i=j;i>=k;--i)
#define sqr(x) ((x)*(x))
#define G getchar()
#define LL long long
#define pdd pair<double,double>
#define mkp make_pair
#define X first
#define Y second
#define N 105
#define inf 10000001
#define eps 0.000001
int n,cnt;
double sum;
pdd p[N],ans[N];
pdd operator -(pdd x,pdd y){
	return mkp(x.X-y.X,x.Y-y.Y);
}
double Cross(pdd x,pdd y){
	return x.X*y.Y-x.Y*y.X;
}
int dcmp(double x){
	if(fabs(x)<eps)return 0;
	return x<0?-1:1;
}
double dist(pdd x,pdd y){
	return sqrt(sqr((x.X-y.X))+sqr(x.Y-y.Y));
}
bool cmp(pdd x,pdd y){
	int flg=dcmp(Cross(x-p[1],y-p[1]));
	return flg?flg>0:dist(x,p[1])<dist(y,p[1]);
}
int main(){
	double x,y;int i;
	while(1){
		scanf("%d",&n);
		if(!n)break;
		rep(i,1,n){
			scanf("%lf%lf",&x,&y);p[i]=mkp(x,y);
			if(p[1]>p[i])swap(p[1],p[i]);
		}
		if(n==1){puts("0.00");continue;}
		if(n==2){printf("%.2lf\n",dist(p[1],p[2]));continue;}
		sort(p+2,p+n+1,cmp);
		cnt=2;ans[1]=p[1];ans[2]=p[2];
		rep(i,3,n){
			while(dcmp(Cross(ans[cnt]-ans[cnt-1],p[i]-ans[cnt]))<0)--cnt;
			ans[++cnt]=p[i];
		}
		sum=0;
		rep(i,2,cnt)sum+=dist(ans[i],ans[i-1]);
		printf("%.2lf\n",dist(ans[1],ans[cnt])+sum);
	}
	return 0;
}