凸包模板 Wall

题意好懂。

自己在输入等一些地方没有注意。。结果错了几次

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<string>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<stack>
#include<cmath>
#include<map>
#include<vector>
#define ll long long
#define inf 0x3f3f3f3f
#define bug1 cout<<"bug1"<<endl;
#define bug2 cout<<"bug2"<<endl;
#define bug3 cout<<"bug3"<<endl;
using namespace std;
const double pi=3.1415926;
const int maxn=1005;
struct Point{
    double x,y;//要用double
    /*
    bool friend operator<(Point a,Point b){
        if(a.x==b.x)return a.y<b.y;
        return a.x<b.x;
    }*/
}node[maxn],res[maxn];
bool cmp(Point a,Point b){
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}
double cross(Point a,Point b,Point c){
    return(a.x-c.x)*(b.y-c.y)-(a.y-c.y)*(b.x-c.x);
}
int convex(int n){
    int m=0;
    sort(node,node+n,cmp);
    for(int i=0;i<n;++i){
        while(m>1&&cross(res[m-1],node[i],res[m-2])<=0)
            m--;
        res[m++]=node[i];
    }
    int k=m;
    for(int i=n-2;i>=0;i--){
        while(m>k&&cross(res[m-1],node[i],res[m-2])<=0)
            m--;
        res[m++]=node[i];
    }
    if(n>1)m--;
    return m;
}
double dis(Point a,Point b){
    return sqrt((b.x-a.x)*(b.x-a.x)+(b.y-a.y)*(b.y-a.y));
}
void init(){
    memset(node,0,sizeof(node));
    memset(res,0,sizeof(res));
}
int main(){
    int n,l;
    while(~scanf("%d%d",&n,&l)){
            init();
        for(int i=0;i<n;++i){
            scanf("%lf%lf",&node[i].x,&node[i].y);//用scanf输入浮点数是用这个的
        }
        int m=convex(n);
        double ans=0;
        res[++m]=node[0];
        for(int i=0;i<m;++i){
            ans+=dis(res[i],res[i+1]);
        }
        ans+=pi*2*l+0.5;
        cout<<(int)ans<<'\n';
    }//我原本写的是//cout<<(int)(ans+pi*2*l+0.5)<<endl;这样会编译错误


}