求一个凸包,利用旋转卡壳的原理,求出来最远距离。由于要求距离的平方就在写distance函数的时候不开放就可以了,反正不会影响大小判断。
//#include <bits/stdc++.h>
#include <iostream>
#include<algorithm>
#include <cstdio>
#include <cmath>
#include <bits/stdc++.h>
#define re register int
//#define int long long
#define inf 0x3f
using namespace std;
const int N=5e5+5;
int n,top,ans;
struct Point{
int x,y;
}point[N],stk[N];
int dis(Point a,Point b)
{
return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
int cross(Point a,Point b,Point c){
return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
void find_miny(){
Point tmp=point[0];
int flag=0;
for(int i=1;i<n;i++){
if(point[i].y<tmp.y||(point[i].y==tmp.y&&point[i].x<tmp.x)){
tmp=point[i];
flag=i;
}
}
if(flag) swap(point[0],point[flag]);
}
bool cmp(Point a,Point b){
int n=cross(point[0],a,b);
if(n>0||(n==0&&dis(point[0],a)>dis(point[0],b))) return true;
return false;
}
void Graham(){
top=-1;
stk[++top]=point[0]; stk[++top]=point[1];
for(int i=2;i<n;i++){
while(top&&cross(stk[top-1],stk[top],point[i])<0) top--;
stk[++top]=point[i];
}
}
void RC(){
ans=0.0;
stk[++top]=point[0];
int j=0;
for(int i=1;i<=top;i++){
while(abs(cross(stk[i-1],stk[i],stk[j]))<abs(cross(stk[i-1],stk[i],stk[j+1]))) j=(j+1)%n;
ans=max(ans,max(dis(stk[j],stk[i-1]),dis(stk[j],stk[i])));
}
}
void solve()
{
cin>>n;
for(int i=0;i<n;i++){
cin>>point[i].x>>point[i].y;
// scanf("%d%d",&point[i].x,&point[i].y);
}
if(n==2) {
cout<<dis(point[0],point[1]);
// printf("%d\n",dis(point[0],point[1]));
return ;
}
find_miny();
sort(point+1,point+n,cmp);
Graham();
RC();
cout<<ans<<endl;
}
signed main() {
solve();
return 0;
}