[COGS 896] 圈奶牛

题目描述：

给你n个点的坐标，问最少用多少花费可以把他们围起来。
传送门

题目分析：

没啥好分析的，就是个裸的凸包。

代码实现：

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
const int maxm=10005;
const double eps=1e-10;
struct Point{
    double x,y;
    Point operator -(Point &s)
    {return (Point){x-s.x,y-s.y};}
};
Point d[maxm];
double operator * (Point p1,Point p2)
{
    return (p1.x*p2.y-p2.x*p1.y);
} 
int stk[maxm],top,n;
double distance(Point p1,Point p2)
{
    return ((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
bool judgeleft(Point p0,Point p1,Point p2)
{
    double s=(p1-p0)*(p2-p0);
    return s<0||(s==0&&distance(p1,p0)>=distance(p2,p0));
}
bool comp(Point p1,Point p2)
{
    double s=(p1-d[1])*(p2-d[1]);
    return s<0||(s==0&&distance(p1,d[1])>=distance(p2,d[1]));
}
int main()
{
    freopen("fc.in","r",stdin);
    freopen("fc.out","w",stdout);
    scanf("%d",&n);
    int Fis=1;
    for(int i=1;i<=n;i++)
    {
        scanf("%lf%lf",&d[i].x,&d[i].y);
        if(d[i].x<d[Fis].x||(d[i].x==d[Fis].x&&d[i].y<d[Fis].y)) Fis=i;
    }
    std::swap(d[Fis],d[1]);
    std::sort(&d[2],&d[n+1],comp);
    d[n+1]=d[1];
    stk[1]=1,stk[2]=2,top=2;
    for(int i=3;i<=n+1;i++)
    {
        while(top>1&&judgeleft(d[stk[top-1]],d[i],d[stk[top]])) top--; 
        stk[++top]=i;
    }
    double ans=0;
    for(int i=1;i<top;i++)
     ans+=sqrt(distance(d[stk[i]],d[stk[i+1]]));
    printf("%.2lf\n",ans);
    return 0; 
}