poj 2412

                题目意思没啥好说。。。求平面上距离最远的两个点。

          用凸包可解。先构造凸包，然后枚举凸包上的所有点对即可。

 

         

#include<cstdio>
#include<cstring>
#include<iostream>
#include<utility>
#include<string>
#include<set>
#include<vector>
#include<stack>
#include<algorithm>
#include<queue>
#include<cstdlib>
#include<cmath>
using namespace std;
const int inf=1<<29;
const int M=51000;
const double eps=1e-8;
struct point
{
	int x,y;
}points[M],stac[2*M];
int n,top;

double dis(point a,point b)
{
	return sqrt((double)((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)));
}

double dis1(point a,point b)
{
	return ((double)((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)));
}

double cross(point p0,point p1,point p2)
{
	return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}

bool cmp(point p,point q)
{
	double k=cross(points[0],p,q);
	if(k<-eps)
		return 0;
	else if(fabs(k)<eps && (dis(p,points[0])-dis(q,points[0])>eps))
		return 0;
	else return 1;
}

void cover_hull()
{
	int miny=points[0].y,index=0;
	for(int i=1;i<n;i++)
	{
		if(points[i].y<miny)
		{
			miny=points[i].y;
			index=i;
		}
		else if(points[i].y==miny && points[i].x<points[index].x)
		{
			index=i;
		}
	}
	point temp;
	temp=points[index];
	points[index]=points[0];
	points[0]=temp;
	sort(points+1,points+n,cmp);
	top=1;
	stac[0]=points[n-1];
	stac[1]=points[0];
	int k=1;
	while(k<=n-1)
	{
		double d=cross(stac[top],stac[top-1],points[k]);
		if(d<=0)
		{
			top++;
			stac[top]=points[k];
			k++;
		}
		else top--;
	}
}

int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d%d",&points[i].x,&points[i].y);
	}
	cover_hull();
	double ans=0;
	for(int i=0;i<top-1;i++)
		for(int j=i+1;j<top;j++)
		{
			double d=dis1(stac[i],stac[j]);
			if(d>ans)
				ans=d;
		}
	printf("%.0lf\n",ans);
	return 0;
}