给出一些平面点集,然后求这个点集中的两点的最大距离。第一道旋转卡壳~~~
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stack>
#include<queue>
#include<math.h>
#include<cstdio>
using namespace std;
struct point
{
int x,y;
point() {}
point(int x,int y): x(x),y(y) {}
}p[50010],res[50010];
int cross(point a,point b,point op)
{
return (a.x-op.x)*(b.y-op.y)-(a.y-op.y)*(b.x-op.x);
}
int dist(point a,point b)
{
return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
bool mult(point sp, point ep, point op)
{
return (sp.x - op.x) * (ep.y - op.y)
>= (ep.x - op.x) * (sp.y - op.y);
}
bool operator < (const point &l, const point &r)
{
return l.y < r.y || (l.y == r.y && l.x < r.x);
}
int graham(point pnt[], int n, point res[])
{
int i, len, k = 0, top = 1;
sort(pnt, pnt + n);
if (n == 0) return 0; res[0] = pnt[0];
if (n == 1) return 1; res[1] = pnt[1];
if (n == 2) return 2; res[2] = pnt[2];
for (i = 2; i < n; i++)
{
while (top && mult(pnt[i], res[top], res[top-1]))
top--;
res[++top] = pnt[i];
}
len = top; res[++top] = pnt[n - 2];
for (i = n - 3; i >= 0; i--)
{
while (top!=len && mult(pnt[i], res[top],
res[top-1])) top--;
res[++top] = pnt[i];
}
return top;
}
int rctnb(point pnt[],int n)
{
int ans=0;
int q=1;
pnt[n]=pnt[0];
for(int i=0;i<n;i++)
{
while(abs(cross(pnt[i],pnt[i+1],pnt[q+1]))>abs(cross(pnt[i],pnt[i+1],pnt[q])))
q=(q+1)%n;
ans=max(ans,max(dist(pnt[i],pnt[q]),dist(pnt[i+1],pnt[q])));
}
return ans;
}
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
scanf("%d%d",&p[i].x,&p[i].y);
int cnt=graham(p,n,res);
printf("%d\n",rctnb(res,cnt));
}
return 0;
}