poj 2187（旋转卡壳）

传送门
模板题，求凸包，用旋转卡壳求出最远点对。
因为把int弄成double，WA了好几次，差点对idy大神给的模板失去信心。。。不过事实证明idy的写法没问题，orz！

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
#define eps 1e-10
#define MAXN 50002
int n,nxt[MAXN];
struct Point {
    int x,y;
    Point (int x=0,int y=0):x(x),y(y) {}
    friend bool operator <(const Point &a,const Point &b) {
        return a.x<b.x||(a.x==b.x&&a.y<b.y);
    }
};
typedef Point Vector;
vector<Point> Po,S;
Vector operator + (Vector a,Vector b) {return Vector(a.x+b.x,a.y+b.y);}
Vector operator - (Vector a,Vector b) {return Vector(a.x-b.x,a.y-b.y);}
Vector operator * (Vector a,int s) {return Vector(a.x*s,a.y*s);}
Vector operator / (Vector a,int s) {return Vector(a.x/s,a.y/s);}
inline int dcmp(int x) {return (x>-eps)-(x<eps);}
inline int dot(Vector a,Vector b) {return a.x*b.x+a.y*b.y;}
inline int cross(Vector a,Vector b) {return a.x*b.y-a.y*b.x;}
inline int len(Vector a) {return dot(a,a);}
inline int area(Point a,Point b,Point c) {return fabs(cross(b-a,b-c)/2.0);}
vector<Point> convex(vector<Point> Po) {
    S.clear();
    int n=Po.size(),top=0;
    sort(Po.begin(),Po.end());
    for (int i=0;i<n;++i) {
        while (top>1&&cross(S[top-1]-S[top-2],Po[i]-S[top-2])<=0) S.pop_back(),--top;
        S.push_back(Po[i]),++top;
    }
    int k=top;
    for (int i=n-2;i>=0;--i) {
        while (top>k&&cross(S[top-1]-S[top-2],Po[i]-S[top-2])<=0) S.pop_back(),--top;
        S.push_back(Po[i]),++top; 
    }
    if (n>1) S.pop_back(),--top;
    return S;
}
int maxdis(vector<Point> p) {
    int j=1,n=p.size();
    int ret=0;
    p[n]=p[0];
    for (int i=0;i<n;++i) {
        while (fabs(cross(p[i+1]-p[i],p[j]-p[i]))<fabs(cross(p[i+1]-p[i],p[j+1]-p[i])))
        j=(j+1)%n;
        ret=max(ret,max(len(p[j]-p[i]),len(p[j]-p[i+1])));
    }
    return ret;
}
int main() {
//  freopen("poj 2187.in","r",stdin);
    scanf("%d",&n);
    for (register int i=1;i<=n;++i) {
        int x,y;
        scanf("%d%d",&x,&y);
        Po.push_back(Point(x,y)); 
    }
    printf("%d\n",maxdis(convex(Po)));
    return 0;
}