【凸包模板】POJ3348 Cows

【题目描述】

• 传送门

【代码】

• 凸包模板

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
struct Point{
	double x,y;
}a[N],s[N];
int n,top=1;
double ans=0,t;
inline double check(Point a1,Point a2,Point b1,Point b2){
	return (a2.x-a1.x)*(b2.y-b1.y)-(a2.y-a1.y)*(b2.x-b1.x);
}
inline double dis(Point a,Point b){
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
inline int cmp(Point a1,Point a2){
	double t=check(a[1],a1,a[1],a2);
	if(t>0) return 1;
	if(t==0&&dis(a[0],a1)<dis(a[0],a2)) return 1;
	return 0;
}
inline void Graham(){
	sort(a+2,a+n+1,cmp);
	s[1]=a[1];
	for(int i=2;i<=n;++i){
		while(top>1&&check(s[top-1],s[top],s[top],a[i])<=0) top--;
		s[++top]=a[i];
	}
	s[++top]=a[1];
	for(int i=1;i<top;++i)
		ans+=dis(s[i],s[i+1]);
	printf("%.2f",ans);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%lf%lf",&a[i].x,&a[i].y);
		if(i!=1&&a[i].y<a[1].y){
			t=a[1].x;a[1].x=a[i].x;a[i].x=t;
			t=a[1].y;a[1].y=a[i].y;a[i].y=t;
		}
	}
	Graham();
	return 0;
}