凸包——Luogu2742 [USACO5.1]圈奶牛Fencing the Cows

传送门
二维凸包裸题
还是按照极角排序（可能我的排序方式怪异一点的）
然后开栈用Graham求出凸包周长即可
其他那就不多讲了

#include<bits/stdc++.h>
using namespace std;
struct ppap{double x,y,dis,j;}a[100001];
int n,p,sum=0;
double ans=0,sx=1e9,sy=1e9;
ppap s[100001];
inline double sqr(double x){return x*x;}
inline bool cmp(ppap a,ppap b){return a.j<b.j;}
inline bool cmp1(ppap a,ppap b){return a.dis<b.dis;}
inline bool cmp2(ppap a,ppap b){return a.dis>b.dis;}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%lf%lf",&a[i].x,&a[i].y);
        if(a[i].y==sy&&a[i].x<sx)p=i,sx=a[i].x,sy=a[i].y;
        if(a[i].y<sy)p=i,sx=a[i].x,sy=a[i].y;
    }
    for(int i=1;i<=n;i++){
        a[i].x-=sx;
        a[i].y-=sy;
        if(a[i].x==0&&a[i].y==0)a[i].j=0;
        else if(a[i].x!=0)a[i].j=atan2(a[i].y,a[i].x)*180/acos(-1);
        else a[i].j=90;
        a[i].dis=sqr(a[i].x)+sqr(a[i].y);
    }
    swap(a[1],a[p]);
    sort(a+2,a+n+1,cmp);a[++n]=a[1];
    s[++sum]=a[1];s[++sum]=a[2];ans=sqrt(sqr(a[2].x-a[1].x)+sqr(a[2].y-a[1].y));
    for(int i=3;i<=n;i++){
        while(sum>=2){
            double p=(a[i].x-s[sum-1].x)*(s[sum].y-s[sum-1].y)-(s[sum].x-s[sum-1].x)*(a[i].y-s[sum-1].y);
            if(p>0)sum--,ans-=sqrt(sqr(s[sum+1].x-s[sum].x)+sqr(s[sum+1].y-s[sum].y));
            else break;
        }
        s[++sum]=a[i],ans+=sqrt(sqr(s[sum].x-s[sum-1].x)+sqr(s[sum].y-s[sum-1].y));
    }
    printf("%.2lf",ans);
    return 0;
}