Beauty Contest(POJ 2187)

• 原题如下：
  Beauty Contest

  Time Limit: 3000MS		Memory Limit: 65536K
  Total Submissions: 42961		Accepted: 13307

  Description

  Bessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the title 'Miss Cow World'. As a result, Bessie will make a tour of N (2 <= N <= 50,000) farms around the world in order to spread goodwill between farmers and their cows. For simplicity, the world will be represented as a two-dimensional plane, where each farm is located at a pair of integer coordinates (x,y), each having a value in the range -10,000 ... 10,000. No two farms share the same pair of coordinates.

  Even though Bessie travels directly in a straight line between pairs of farms, the distance between some farms can be quite large, so she wants to bring a suitcase full of hay with her so she has enough food to eat on each leg of her journey. Since Bessie refills her suitcase at every farm she visits, she wants to determine the maximum possible distance she might need to travel so she knows the size of suitcase she must bring.Help Bessie by computing the maximum distance among all pairs of farms.

  Input

  * Line 1: A single integer, N

  * Lines 2..N+1: Two space-separated integers x and y specifying coordinate of each farm

  Output

  * Line 1: A single integer that is the squared distance between the pair of farms that are farthest apart from each other. 

  Sample Input

  4
  0 0
  0 1
  1 1
  1 0
  

  Sample Output

  2
  

  Hint

  Farm 1 (0, 0) and farm 3 (1, 1) have the longest distance (square root of 2) 
• 题解：
  • 显然，如果某个点在另外三个点组成的三角形的内部，那么它就不可能属于最远点对，因而可以删去。这样，最后需要考虑的点，就只剩下不在任意三个点组成的三角形内部的，所给点集中最外围的点了。这些最外围的点的集合，就是包围原点集的最小凸多边形的顶点组成的集合，称为原点集的凸包。因为顶点的坐标限定为整数，坐标值的范围不超过M的凸多边形的顶点数只有O((√M)^2/3)个，所以只要枚举凸包上的所有点对并计算距离就可以求得最远点对了。
  • 求凸包的算法很多，求n个点集对应的凸包，只要O(nlogn)时间。
    一种基于平面扫描法的Graham扫描算法：
    首先，把点集按x坐标→y坐标的字典序升序排序，那么排序后的第一个和最后一个点必然是凸包上的顶点，它们之间的部分可以分成上下两条链分别求解。求下侧的链时只要从小到大处理排序后的点列，逐步构造凸包，在构造过程中的凸包末尾加上新的顶点后，可能会破坏凸性，此时只要将凹的部分的点从末尾出去就好了。求上侧的链也是一样地从大到小处理即可。排序的复杂度为O(nlogn)，剩余部分处理的复杂度为O(n)。
  • 旋转卡壳法：
    假设最远点对是p和q，那么p就是点集中(p-q)方向最远的点，而q是点集中(q-p)方向最远的点，因此，可以按照逆时针逐渐改变方向，同时枚举出所有对于某个方向上最远的点对(这样的点对又叫做对踵点对)，那么最远点对一定也包含于其中。在逐渐改变方向的过程中，对踵点对只有在方向等于凸包某条边的法线方向时发生变化，此时点将向凸包上对应的相邻点移动。另方向逆时针旋转一周，那么对踵点对也在凸包上转了一周，这样就可以在凸包顶点的线性时间内求得最远点对。
    附一张示意图：
    
• 代码1：

   #include <cstdio>
   #include <vector>
   #include <algorithm>
   #include <cmath>
  
   using namespace std;
  
   const double EPS=1e-;
  
   double add(double a, double b)
   {
       if (fabs(a+b)<EPS*(fabs(a)+fabs(b))) return ;
       return a+b;
   }
  
   struct P
   {
       double x, y;
       P(){}
       P(double x, double y): x(x), y(y) {}
       P operator - (P p)
       {
           return P(add(x, -p.x), add(y, -p.y));
       }
       double det(P p)
       {
           return add(x*p.y, -y*p.x);
       }
       double dot(P p)
       {
           return add(x*p.x, y*p.y);
       }
   };
  
   const int MAX_N=;
   int N;
   P ps[MAX_N];
  
   bool cmp_x(const P &p, P &q)
   {
       if (p.x!=q.x) return p.x<q.x;
       return p.y<q.y;
   }
  
   vector<P> convex_hull(P * ps, int n)
   {
       sort(ps, ps+n, cmp_x);
       int k=;
       vector<P> qs(n*);
       for (int i=; i<n; i++)
       {
           while (k> && (qs[k-]-qs[k-]).det(ps[i]-qs[k-])<=) k--;
           qs[k++]=ps[i];
       }
       for (int i=n-, t=k; i>=; i--)
       {
           while (k>t && (qs[k-]-qs[k-]).det(ps[i]-qs[k-])<=) k--;
           qs[k++]=ps[i];
       }
       qs.resize(k-);
       return qs;
   }
  
   double max(int x, int y)
   {
       if (x>y) return x;
       return y;
   }
  
   double dist(P p, P q)
   {
       return (p-q).dot(p-q);
   }
  
   int main()
   {
       scanf("%d", &N);
       for (int i=; i<N; i++)
       {
           scanf("%lf %lf", &ps[i].x, &ps[i].y);
       }
       vector<P> qs=convex_hull(ps, N);
       double res=;
       for (int i=; i<qs.size(); i++)
       {
           for (int j=; j<i; j++)
           {
               res=max(res, dist(qs[i], qs[j]));
           }
       }
       printf("%.0f\n", res);
   }

  代码2：

   #include <cstdio>
   #include <cmath>
   #include <algorithm>
   #include <vector>
  
   using namespace std;
  
   const double EPS=1e-;
  
   double max(double x, double y)
   {
       if (x>y+EPS) return x;
       return y;
   }
  
   double add(double x, double y)
   {
       if (fabs(x+y)<EPS*(fabs(x)+fabs(y))) return ;
       return x+y;
   }
   struct P
   {
       double x, y;
       P(){}
       P(double x, double y): x(x), y(y) {}
       P operator + (P p)
       {
           return P(add(x, p.x), add(y, p.y));
       }
       P operator - (P p)
       {
           return P(add(x, -p.x), add(y, -p.y));
       }
       double dot(P p)
       {
           return add(x*p.x, y*p.y);
       }
       double det(P p)
       {
           return add(x*p.y, -y*p.x);
       }
   };
  
   const int MAX_N=;
   int N;
   P ps[MAX_N];
  
   bool cmp_x(const P &p, const P &q)
   {
       if (p.x!=q.x) return p.x<q.x;
       return p.y<q.y;
   }
  
   double dist(P p, P q)
   {
       return (p-q).dot(p-q);
   }
  
   vector<P> convex_hull(P * ps, int n)
   {
       sort(ps, ps+n, cmp_x);
       int k=;
       vector<P> qs(n*);
       for (int i=; i<n; i++)
       {
           while (k> && (qs[k-]-qs[k-]).det(ps[i]-qs[k-])<=) k--;
           qs[k++]=ps[i];
       }
       for (int i=n-, t=k; i>=; i--)
       {
           while (k>t && (qs[k-]-qs[k-]).det(ps[i]-qs[k-])<=) k--;
           qs[k++]=ps[i];
       }
       qs.resize(k-);
       return qs;
   }
  
   int main()
   {
       scanf("%d", &N);
       for (int i=; i<N; i++)
       {
           scanf("%lf %lf", &ps[i].x, &ps[i].y);
       }
       vector<P> qs=convex_hull(ps, N);
       int n=qs.size();
       if (n==)
       {
           printf("%.0f\n", dist(qs[], qs[]));
           return ;
       }
       int i=, j=;
       for (int k=; k<n; k++)
       {
           if (!cmp_x(qs[i], qs[k])) i=k;
           if (cmp_x(qs[j], qs[k])) j=k;
       }
       double res=;
       int si=i, sj=j;
       while (i!=sj || j!=si)
       {
           res=max(res, dist(qs[i], qs[j]));
           if ((qs[(i+)%n]-qs[i]).det(qs[(j+)%n]-qs[j])<)
           {
               i=(i+)%n;
           }
           else
           {
               j=(j+)%n;
           }
       }
       printf("%.0f\n", res);
   }