题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1069
分析:首先凸包嘛。。。然后就是枚举凸包上的四个点嘛,但是我总觉得这样是不完整的,谁告诉你凸包一定有4个点以上的,谁告诉你,给出的四个点一定是凸多边形的,不管无论如何,直接这样是A掉了。 怎么枚举四个点呢?我们枚举四边形的对角线,然后另外两个点在这条线的两侧,并且距离这条线最长,注意到这两侧的最远点是随着这条线逆时针旋转而旋转的,所以只需要用另外两个指针“指着”这两个点,一边转线,一边移动点就行了,复杂度O(n^2)。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
#include <cassert>
#include <set>
#include <map>
#include <cmath>
#include <ctime>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
#define clr(a,x) memset(a,(x),sizeof(a))
#define eps 1e-9
#define LL long long
#define mp make_pair
const int maxn=2000+5;
const int mod=1e9+7;
int dcmp(double a,double b)
{
if(a<b-eps) return -1;
else if(a>b+eps) return 1;
else return 0;
}
struct Point
{
double x,y;
Point(double x=0,double y=0)
:x(x),y(y) { }
bool operator<(const Point&p) const
{
if(x==p.x) return y<p.y;
return x<p.x;
}
bool operator==(const Point&a) const { return dcmp(a.x,x)==0&&dcmp(y,a.y)==0; }
}pt[maxn],hull[maxn];
inline double Cross(const Point&a,const Point&b) { return a.y*b.x-a.x*b.y; }
Point operator-(const Point&a,const Point&b) { return Point(a.x-b.x,a.y-b.y); }
int ConvexHull(Point* p , int n, Point* ch)
{
sort(p,p+n);
int m = 0;
for (int i = 0 ; i < n ; ++i) {
while (m>1 && dcmp(Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2]),0)<=0) --m;
ch[m++] = p[i];
}
int k = m;
for (int i = n-2 ; i >= 0 ; --i) {
while (m>k && dcmp(Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2]),0)<=0) --m;
ch[m++] = p[i];
}
if (n > 1) --m;
return m;
}
int main()
{
int n;
while(scanf("%d",&n)==1) {
rep(i,0,n) scanf("%lf%lf",&pt[i].x,&pt[i].y);
n=ConvexHull(pt,n,hull);
double ans=0;
while(n<=3);
hull[n]=hull[0];
rep(i,0,n) {
int a=(i+1)%n,b=(i+2)%n,c=(i+3)%n;
for(;;) {
while(dcmp(Cross(hull[b]-hull[i],hull[(a+1)%n]-hull[a]),0)<0) a=(a+1)%n;
while(dcmp(Cross(hull[b]-hull[i],hull[(c+1)%n]-hull[c]),0)>0) c=(c+1)%n;
double A=abs(Cross(hull[a]-hull[i],hull[b]-hull[i]));
A += abs(Cross(hull[b]-hull[i],hull[c]-hull[i]));
if(A>ans) ans=A;
b=(b+1)%n;
if((b+1)%n==i) break;
}
}
printf("%.3lf\n",ans*0.5);
}
}