http://poj.org/problem?id=2187

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include<iostream>
using namespace std;
#define N 50005
const double Pi = acos(-1.0);
struct Point
{
    int x,y;
}P[N],S[N];
int n,top,L;
int Dis(const Point& p1,const Point& p2)
{
    return (p1.x-p2.x)*(p1.x-p2.x) + (p1.y-p2.y)*(p1.y-p2.y) ;
}
double Cross(const Point& p1,const Point& p2,const Point& p3,const Point& p4)
{
    return (p2.x-p1.x)*(p4.y-p3.y) - (p2.y-p1.y)*(p4.x-p3.x);
}
bool cmp(const Point& p1,const Point& p2)
{
    double C = Cross(P[0],p1,P[0],p2);
    return C ? C>0 : Dis(P[0],p1)>Dis(P[0],p2);
}
bool Cmp(Point x,Point y)
{
  if(x.x!=y.x)
   {
	  return x.x<y.x;
   }
  else if(x.x==y.x)
   {
 	  return x.y<y.y;
   }
}
void Pole_Point()
{
    int id;
    Point pp = P[id=0];
    for(int i=1;i<n;i++)
        if(P[i].y < pp.y || P[i].y == pp.y && P[i].x < pp.x)
            pp = P[i] , id = i;
    P[id] = P[0] , P[0] = pp;
}
void Convex_Hull()
{
    Pole_Point();
    sort(P+1,P+n,cmp);
    S[0]=P[0],S[1]=P[1],S[top=2]=P[2];
    for(int i=3;i<n;i++)
    {
        while(top>0&&Cross(S[top-1],S[top],S[top],P[i]) < 0)
            --top;
        S[++top] = P[i];
    }
}
int main(){	
	 
    scanf("%d",&n);
		
	     for(int i=0;i<n;i++)
            scanf("%d%d",&P[i].x,&P[i].y);
           Convex_Hull();
        int ans =-99;
         // S[top+1] = S[0];
      for(int i=0;i<=top;++i)
		  for(int j=i+1;j<=top;j++)
		  {
		    if(Dis(S[i],S[j])>ans)
				ans=Dis(S[i],S[j]);
		  }
		 printf("%d\n",ans);
    
	return 0;
}