poj 2187 Beauty Contest —— 旋转卡壳

题目：http://poj.org/problem?id=2187

学习资料：https://blog.csdn.net/wang_heng199/article/details/74477738

https://www.jianshu.com/p/74c25c0772d6

注意求凸包时先下后上，保持逆时针；

别忘了给点排序囧。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int const xn=;
int n,tot,ans;
struct P{
  int x,y;
  P(int x=,int y=):x(x),y(y) {}
  bool operator < (const P &b) const
  {return x<b.x||(x==b.x&&y<b.y);}
}p[xn],c[xn];
P operator - (const P &a,const P &b){return P(a.x-b.x,a.y-b.y);}
int cross(P a,P b){return a.x*b.y-a.y*b.x;}
int maxx(int x,int y){return x<y?y:x;}
int rd()
{
  int ret=,f=; char ch=getchar();
  while(ch<''||ch>''){if(ch=='-')f=; ch=getchar();}
  while(ch>=''&&ch<='')ret=ret*+ch-'',ch=getchar();
  return f?ret:-ret;
}
void find()
{
  sort(p+,p+n+);//!
  for(int i=;i<=n;i++)//under
    {
      while(tot>&&cross(c[tot]-c[tot-],p[i]-c[tot])<=)tot--;
      c[++tot]=p[i];
    }
  int num=tot;
  for(int i=n-;i;i--)//top
    {
      while(tot>num&&cross(c[tot]-c[tot-],p[i]-c[tot])<=)tot--;
      c[++tot]=p[i];
    }
  tot--;//p[1]
}
int sqr(int x){return x*x;}
int disq(P a,P b){return sqr(a.x-b.x)+sqr(a.y-b.y);}
void work()
{
  ans=disq(c[],c[]); c[tot+]=c[];
  for(int i=,p=;i<=tot;i++)
    {
      while(cross(c[p]-c[i],c[p]-c[i+])<cross(c[p+]-c[i],c[p+]-c[i+]))
    {p++; if(p==tot+)p=;}
      ans=maxx(ans,maxx(disq(c[p],c[i]),disq(c[p+],c[i+])));
    }
}
int main()
{
  n=rd();
  for(int i=;i<=n;i++)p[i].x=rd(),p[i].y=rd();
  find(); work();
  printf("%d\n",ans);
  return ;
}