【BZOJ 1670】[Usaco2006 Oct]Building the Moat护城河的挖掘 裸凸包

裸的凸包。。。。。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#define maxn 10210
using namespace std;
struct P{
	double x,y;
	P(int a=0,int b=0):x(a),y(b){}
}q[maxn],p[maxn];
typedef P Vec;
Vec operator - (P a,P b){return Vec(a.x-b.x,a.y-b.y);}
double cross(Vec a,Vec b){return a.x*b.y-a.y*b.x;}
bool operator<(P a,P b){return a.x==b.x?a.y<b.y:a.x<b.x;}
double dis2(Vec a){return a.x*a.x+a.y*a.y;}
int n;

int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%lf%lf",&p[i].x,&p[i].y);
	}sort(p+1,p+1+n);
	int top=0;
	for(int i=1;i<=n;i++){
		while(top>1&&cross(q[top]-q[top-1],p[i]-q[top-1])<=0)top--;
		q[++top]=p[i];
	}int m=top;
	for(int i=n-1;i>=1;i--){
		while(top>m&&cross(q[top]-q[top-1],p[i]-q[top-1])<=0)top--;
		q[++top]=p[i];
	}
	double ans=0;
	for(int i=2;i<=top;i++)ans+=sqrt(dis2(q[i]-q[i-1]));
	printf("%.2lf",ans);
	return 0;
}