参考题目:洛谷P2742
解析:
板子就是我这个博客上万年不填的坑啊。
GrahamGrahamGraham扫描法。
代码:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define gc getchar
#define pc putchar
#define cs const
inline
int getint(){
re int num;
re char c;
while(!isdigit(c=gc()));num=c^48;
while(isdigit(c=gc()))num=(num<<1)+(num<<3)+(c^48);
return num;
}
inline
double getdb(){
re double x=0.0,y=1.0;
re char c;
re bool f=0;
while(!isdigit(c=gc()))f^=c=='-';x=c^48;
while(isdigit(c=gc()))x=(x*10)+(c^48);
if(c!='.')return f?-x:x;
while(isdigit(c=gc()))x+=(y/=10)*(c^48);
return f?-x:x;
}
cs int N=10002;
cs double eps=1e-6;
struct Point{
double x,y;
Point(double _x=0,double _y=0):x(_x),y(_y){}
Point operator+(cs Point &b)cs{return Point(x+b.x,y+b.y);}
Point operator-(cs Point &b)cs{return Point(x-b.x,y-b.y);}
Point operator*(cs double &b)cs{return Point(x*b,y*b);}
double operator*(cs Point &b)cs{return x*b.y-y*b.x;}
double dot()cs{return x*x+y*y;}
friend double dot(cs Point &a,cs Point &b){return a.x*b.x+a.y*b.y;}
friend double cross(cs Point &a,cs Point &b){return a.x*b.y-a.y*b.x;}
}O,q[N];
inline
double dist(cs Point &a){
return sqrt(a.dot());
}
inline
double dist(cs Point &a,cs Point &b){
return sqrt((a-b).dot());
}
inline
bool cmp(cs Point &a,cs Point &b){
return fabs(a.x-b.x)<eps?a.y<b.y:a.x<b.x;
}
struct Polygon{
Point p[N];
int n;
Polygon convex_hull(Point *q,int m){
sort(q+1,q+m+1,cmp);
n=0;
for(int re i=1;i<=m;++i){
while(n>=2&&cross(q[i]-p[n-1],p[n]-p[n-1])>-eps)--n;
p[++n]=q[i];
}
int k=n;
for(int re i=m;i>=1;--i){
while(n>k&&cross(q[i]-p[n-1],p[n]-p[n-1])>-eps)--n;
p[++n]=q[i];
}
if(m>1)--n;
return *this;
}
double circu(){
double res=0;
for(int re i=2;i<=n;++i)
res+=dist(p[i-1],p[i]);
res+=dist(p[1],p[n]);
return res;
}
}poly;
int m;
signed main(){
m=getint();
for(int re i=1;i<=m;++i)q[i].x=getdb(),q[i].y=getdb();
printf("%.2f\n",poly.convex_hull(q,m).circu());
return 0;
}