POJ1113:Wall

POJ1113

求完凸包算总长度，然后+2piL。结束。
我还sb的把每个角都求了一遍加起来。。后来发现其实就是360°。
重要的事情说三遍：用C++！用C++！用C++！

【代码】

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#define N 10005
#define INF 0x7fffffff
using namespace std;
const double pi=acos(-1.0);
int read()
{
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
    return x*f;
}

int n,top,L;
double ans;

class Point{
    public:
        int x,y;
    Point(){}
    Point(int xx,int yy){
        x=xx,y=yy;
    }
}e[N],q[N];

bool operator <(Point a,Point b){
    return a.x<b.x||(a.x==b.x&&a.y<b.y);
}

Point operator -(Point a,Point b){
    return Point(a.x-b.x,a.y-b.y);
}

double Cross(Point a,Point b){
    return a.x*b.y-a.y*b.x;
}

void Andrew()
{
    sort(e+1,e+1+n);
    q[++top]=e[1];
    for(int i=2;i<=n;i++){
        while(top>1&&Cross(q[top]-q[top-1],e[i]-q[top-1])<=0) top--;
        q[++top]=e[i];
    }
    int k=top;
    for(int i=n-1;i;i--){
        while(top>k&&Cross(q[top]-q[top-1],e[i]-q[top-1])<=0) top--;
        q[++top]=e[i];
    }
    n=top-1;
}

double Get_Dis(Point a,Point b){
    return sqrt(1.0*(a.x-b.x)*(a.x-b.x)+1.0*(a.y-b.y)*(a.y-b.y));
}

void Solve()
{
    for(int i=2;i<=n;i++)
        ans+=Get_Dis(q[i],q[i-1]);
    ans+=Get_Dis(q[1],q[n]);
    ans+=L*pi*2;
    printf("%.0lf\n",ans);
}

int main()
{
    n=read();L=read();
    for(int i=1;i<=n;i++)
        e[i].x=read(),e[i].y=read();
    Andrew();
    Solve();
    return 0;
}