[POJ 2187/Luogu 1452]Beauty Contest

题目描述：

给你n个点，求任意两两之间点的最大距离的平方。

题目分析：

N<=50000 $N^2$的暴力不可过。
最大的距离肯定是在凸包上的点上取到，于是先求凸包，然后$N^2$枚举凸包上的点，凸包上的点不会太多，所以可过。

代码实现

Jarvis（Luogu 34ms POJ 400+ms）

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
int n;
struct Point{
    int x,y;
    Point operator -(Point &s)
    {return (Point){x-s.x,y-s.y};}
};
Point d[100051];
int stk[100051];
double operator * (Point p1,Point p2)
{
    return (p1.x*p2.y-p2.x*p1.y);
} 
int distance(Point p1,Point p2)
{
    return (p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y);
}
bool judgeleft(Point p0,Point p1,Point p2)
{
    int s=(p1-p0)*(p2-p0);
    return s<0||(s==0&&distance(p1,p0)>=distance(p2,p0));
}
int main()
{
    scanf("%d",&n);
    int Fis=1;
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&d[i].x,&d[i].y);
        if(d[i].x<d[Fis].x||(d[i].x==d[Fis].x&&d[i].y<d[Fis].y)) Fis=i;
    }
    int top=0; 
    stk[++top]=Fis;
    do{
        int ep=1;
        for(int i=2;i<=n;i++)
         if(judgeleft(d[stk[top]],d[i],d[ep])) ep=i;
        stk[++top]=ep;
    }while(stk[top]!=Fis);
    top--;
    int ans=0;
    for(int i=1;i<=top;i++)
     for(int j=1;j<=top;j++)
      ans=std::max(ans,distance(d[stk[i]],d[stk[j]]));
    printf("%d\n",ans);
    return 0;
}

Graham（Luogu 16ms POJ 172ms）

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
const int maxm=50005;
const double eps=1e-10;
struct Point{
    int x,y;
    Point operator -(Point &s)
    {return (Point){x-s.x,y-s.y};}
};
Point d[maxm];
double operator * (Point p1,Point p2)
{
    return (p1.x*p2.y-p2.x*p1.y);
} 
int stk[maxm],top,n;
int distance(Point p1,Point p2)
{
    return (p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y);
}
bool judgeleft(Point p0,Point p1,Point p2)
{
    int s=(p1-p0)*(p2-p0);
    return s<0||(s==0&&distance(p1,p0)>=distance(p2,p0));
}
bool comp(Point p1,Point p2)
{
    int s=(p1-d[1])*(p2-d[1]);
    return s<0||(s==0&&distance(p1,d[1])>=distance(p2,d[1]));
}
int main()
{
    scanf("%d",&n);
    int Fis=1;
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&d[i].x,&d[i].y);
        if(d[i].x<d[Fis].x||(d[i].x==d[Fis].x&&d[i].y<d[Fis].y)) Fis=i;
    }
    std::swap(d[Fis],d[1]);
    std::sort(&d[2],&d[n+1],comp);
    d[n+1]=d[1];
    stk[1]=1,stk[2]=2,top=2;
    for(int i=3;i<=n+1;i++)
    {
        while(top>1&&judgeleft(d[stk[top-1]],d[i],d[stk[top]])) top--; 
        stk[++top]=i;
    }
    int ans=0;
    for(int i=1;i<=top;i++)
     for(int j=1;j<=top;j++)
      ans=std::max(ans,distance(d[stk[i]],d[stk[j]]));
    printf("%d\n",ans);
    return 0; 
}