太感动了！第一次自己打出了USACO5.1的题~ [USACO5.1]圈奶牛Fencing the Cows

#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
int s=10000+5;
struct node{
    double x,y;
}a[10010];
int gougu(int u,int v){
    return sqrt((a[u].x-a[v].x)*(a[u].x-a[v].x)+(a[u].y-a[v].y)*(a[u].y-a[v].y));
}//勾股定理
int cmp(node j,node i){
    return j.x<i.x;
}
bool pd(int u,int v,int w){
    return (a[u].y-a[w].y)*(a[v].x-a[w].x)>(a[u].x-a[v].x)*(a[v].y-a[w].y);
}//斜率比较
int main(){
    int n,i,j,k,l;
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>a[i].x>>a[i].y;
    }
    sort(a+1,a+n+1,cmp);
    int top=2,sb[s];
    sb[1]=1;
    sb[2]=2;
    for(i=3;i<=n;i++){
        while(top>1 && !pd(i,sb[top],sb[top-1])) top--;
        sb[++top]=i;
    }
    double ans=0;
    for(i=1;i<top;i++){
        ans+=gougu(sb[i],sb[i+1]);

    }

//扫一遍上边
    top=2;
    sb[1]=1;
    sb[2]=2;
    for(i=3;i<=n;i++){
        while(top>1 && pd(i,sb[top],sb[top-1])) top--;
        sb[++top]=i;
    }
    for(i=1;i<top;i++){
        ans+=gougu(sb[i],sb[i+1]);

    }

//扫一遍下边
    printf("%.2lf\n",ans);
    return 0;
}