poj2187 凸包+graham+旋转卡壳+最远点对

#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
#define MAXN 50005
struct Point
{
    int x, y;
    bool operator < (const Point& _P) const
    {
        return y<_P.y||(y==_P.y&&x<_P.x);
    };
}point[MAXN],stack[MAXN];
int cross(Point a,Point b,Point o)      
{
    return (a.x - o.x) * (b.y - o.y) - (b.x - o.x) * (a.y - o.y);
}
//graham()求凸包 
void convex_hull(Point *p,Point *stack,int n,int &len)
{
    sort(p, p+n);
    stack[0]=p[0];
    stack[1]=p[1];
    int top=1;
    for(int i=2;i<n;i++)
    {
        while(top>0&&cross(stack[top],p[i],stack[top-1])<=0)
            top--;
        stack[++top]=p[i];
    }
    int tmp=top;
    for(int i=n-2;i>=0;i--)
    {
        while(top>tmp&&cross(stack[top],p[i],stack[top-1])<=0)
            top--;
        stack[++top]=p[i];
    }
    len=top;    
}
int dist(Point a,Point b)
{
    return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
//旋转卡壳 
int rotating_calipers(Point *stack,int n)
{
    int q=1,ans=0;
    stack[n]=stack[0];
    for(int p=0;p<n;p++)
    {
        while(cross(stack[p+1],stack[q+1],stack[p])>cross(stack[p+1],stack[q],stack[p]))
            q=(q+1)%n;
        ans=max(ans,max(dist(stack[p],stack[q]),dist(stack[p+1],stack[q+1])));            
    }
    return ans; 
}
int main()
{
    int n, len;
    while(scanf("%d", &n)!=EOF)
    {
        for(int i = 0;i < n;i++)
        {
            scanf("%d %d",&point[i].x,&point[i].y);
        }
        convex_hull(point,stack,n,len);
        printf("%d\n",rotating_calipers(stack,len));
    }
    return 0;
}