Luogu P2742 圈奶牛

第一次计算几何

题目大意：

给定平面内一些点，求凸包周长。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int n,sum;
double ans;
struct Point
{
	double x,y;
	Point(double x=0,double y=0):x(x),y(y){}
}p[10010],ch[10010];
const double eps=1e-8;
int dcmp(double x)
{
	if(fabs(x)<eps) return 0;
	else return x<0?-1:1;
}
typedef Point Vector;
Vector operator + (Vector A,Vector B) {return Vector(A.x+B.x,A.y+B.y);}
Vector operator - (Point A,Point B) {return Vector(A.x-B.x,A.y-B.y);}
Vector operator * (Vector A,double p){return (A.x*p,A.y*p);}
Vector operator / (Vector A,double p){return (A.x/p,A.y/p);}
bool operator == (Vector A,Vector B) {return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;}
bool operator < (const Point& a,const Point& b){return a.x<b.x||a.x==b.x&&a.y<b.y;}
double Cross(Vector A,Vector B)
{
	return A.x*B.y-A.y*B.x;
}
double dis(Point A,Point B)
{
	return sqrt((double)(A.x-B.x)*(A.x-B.x)*1.0+(double)(A.y-B.y)*(A.y-B.y)*1.0);
}
int ConvexHull(Point *p,int n,Point *ch)
{
	sort(p,p+n);
	int m=0;
	for(int i=0;i<n;i++)
	{
		while(m>1&&Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
		ch[m++]=p[i];
	}
	int k=m;
	for(int i=n-2;i>=0;i--)
	{
		while(m>k&&Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
		ch[m++]=p[i];
	}
	if(n>1) m--;
	return m;
}
int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++) scanf("%lf%lf",&p[i].x,&p[i].y);
	sum=ConvexHull(p,n,ch);
	for(int i=0;i<sum;i++) ans+=dis(ch[i],ch[i+1]);
	ans+=dis(ch[sum],ch[0]);
	printf("%.2lf",ans);
	return 0;
}