摘要：
题目大意：n个点求凸包，然后求凸包上距离最远的两点。求凸包然后枚举。恩...旋转卡壳不会。View Code #include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>#include<algorithm>using namespace std;#define MaxN 50010struct point{ int x,y; }p[MaxN];int n;int s[MaxN],top;int a[MaxN],cnt;bool v[MaxN];int cro 阅读全文
