zoj 1453

# include <stdio.h>
# include <math.h>
# include <algorithm>
using namespace std;
struct node {
    double x,y;
}vex[109],ans[109];
int cmp(node a ,node b)
{
    if(a.x==b.x)
        return a.y<b.y;
    else
        return a.x<b.x;
}
double cross(node a,node b,node c)
{
    return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
int convex(int n)
{
    sort(vex,vex+n,cmp);
    int m=0;
    for(int i=0;i<n;i++)
    {
        while(m>1&&cross(ans[m-2],ans[m-1],vex[i])<=0.0)  m--;
        ans[m++]=vex[i];
    }
    int k=m;
    for(int i=n-2;i>=0;i--)
    {
        while(m>k&&cross(ans[m-2],ans[m-1],vex[i])<=0.0) m--;
        ans[m++]=vex[i];
    }
    if(n>1)
        m--;
    return m;
}
double dis(node a,node b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int main ()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0) break;
        for(int i=0;i<n;i++)
            scanf("%lf%lf",&vex[i].x,&vex[i].y);
        int m=convex(n);
        ans[m]=ans[0];
        double an=0;
        for(int i=0;i<m;i++)
            an+=dis(ans[i],ans[i+1]);
        printf("%.2lf\n",an);
    }
    return 0;
}

以后可以当模板用了