hdu 1392 Surround the Trees 凸包

Surround the Trees

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10412    Accepted Submission(s): 4036

Problem Description

There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the minimal required length of the rope. However, he does not know how to calculate it. Can you help him? 
The diameter and length of the trees are omitted, which means a tree can be seen as a point. The thickness of the rope is also omitted which means a rope can be seen as a line.



There are no more than 100 trees.

 

Input

The input contains one or more data sets. At first line of each input data set is number of trees in this data set, it is followed by series of coordinates of the trees. Each coordinate is a positive integer pair, and each integer is less than 32767. Each pair is separated by blank.

Zero at line for number of trees terminates the input for your program.

 

Output

The minimal length of the rope. The precision should be 10^-2.

 

Sample Input

  
  

   
   9 
12 7 
24 9 
30 5 
41 9 
80 7 
50 87 
22 9 
45 1 
50 7 
0 
  
  

 

Sample Output

  
  

   
   243.06
  
  

 

Source

Asia 1997, Shanghai (Mainland China)

题意：给出一些树，要求用绳子把所有的树围起来，问绳子的长度最少是多少。

解：凸包，坑点是，如果所有树共线，那么答案是最远两点的距离。

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define for0(a, n) for (int (a) = 0; (a) < (n); (a)++)
#define for1(a, n) for (int (a) = 1; (a) <= (n); (a)++)
#define mes(a,x,s)  memset(a,x,(s)*sizeof a[0])
#define mem(a,x)  memset(a,x,sizeof a)
#define sqr(x)  ((x)*(x))
typedef long long ll;
typedef pair<int, int> pii;
const int INF =0x3f3f3f3f;
const int maxn=  100  ;


const double PI=acos(-1.0);
const double eps=1e-10;
int dcmp(double x)
{
    if(fabs(x)<eps)  return 0;
    else return x<0?-1:1;
}
struct Point
{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y) {};
    bool operator ==(const Point B)const {return dcmp(x-B.x)==0&&dcmp(y-B.y)==0;}

    bool operator<(const Point& b)const
    {
        return dcmp(x-b.x)<0|| dcmp(x-b.x)==0 &&dcmp(y-b.y)<0;
    }
};
typedef Point Vector;
Vector operator -(Vector A,Vector B) {return Vector(A.x-B.x,A.y-B.y); }


double Cross(Vector A,Vector B){return A.x*B.y-A.y*B.x;}

double Dot(Vector A,Vector B){return A.x*B.x+A.y*B.y;}


Vector operator +(Vector A,Vector B) {return Vector(A.x+B.x,A.y+B.y); }
Vector operator *(Vector A,double p) {return Vector(A.x*p,A.y*p); }
Vector operator /(Vector A,double p) {return Vector(A.x/p,A.y/p); }
Vector operator -(Vector A)  {return  Vector(-A.x,-A.y);}



int ConvexHell(Point *p,int n,Point *ch)
{
    sort(p,p+n);
     int m=0;
    for(int i=0;i<n;i++)
    {
        while(m>1&&Cross(ch[m-1]-ch[m-2],p[i]-ch[m-1]   )<=0   )  m--;
        ch[m++]=p[i];
     }
    int k=m;
    for(int i=n-2;i>=0;i--)
    {
        while(m>k &&Cross(ch[m-1]-ch[m-2],p[i]-ch[m-1] )<=0)   m--;
        ch[m++]=p[i];
    }
    if(n>1)  m--;
    return m;

}

double dis(Point A,Point B)
{
    return sqrt(sqr(A.x-B.x)+sqr(A.y-B.y));
}
int n;Point p[maxn+10],p2[maxn+10];

int main()
{
    std::ios::sync_with_stdio(false);
    while(cin>>n&&n)
    {
        for0(i,n)  cin>>p[i].x>>p[i].y;
        int m=ConvexHell(p,n,p2);
        double L=0;
        for0(i,m)
        {
           L+=dis(p2[i],p2[(i+1)%m]);
        }
        if(m==2) L/=2;
        if(L<eps)  puts("0.00");
        else printf("%.2f\n",L);

    }


    return 0;
}