Iahub has drawn a set of n points in the cartesian plane which he calls "special points". A quadrilateral is a simple polygon without self-intersections with four sides (also called edges) and four vertices (also called corners). Please note that a quadrilateral doesn't have to be convex. A special quadrilateral is one which has all four vertices in the set of special points. Given the set of special points, please calculate the maximal area of a special quadrilateral.
The first line contains integer n (4 ≤ n ≤ 300). Each of the next n lines contains two integers: xi, yi ( - 1000 ≤ xi, yi ≤ 1000) — the cartesian coordinates of ith special point. It is guaranteed that no three points are on the same line. It is guaranteed that no two points coincide.
Output a single real number — the maximal area of a special quadrilateral. The answer will be considered correct if its absolute or relative error does't exceed 10 - 9.
5 0 0 0 4 4 0 4 4 2 3
16.000000
In the test example we can choose first 4 points to be the vertices of the quadrilateral. They form a square by side 4, so the area is 4·4 = 16.
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
using namespace std;
struct node
{
double x;
double y;
};
node p[305];
double multi(node p1,node p2,node p3) //p1p2向量 叉乘 p1p3向量
{
double a1,b1,a2,b2;
a1=p2.x-p1.x,a2=p3.x-p2.x;
b1=p2.y-p1.y,b2=p3.y-p2.y;
return a1*b2-a2*b1;
}
int main()
{
int i,j,k,n;
double res;
while(~scanf("%d",&n))
{
res=0;
for(i=0;i<n;i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++) //列舉每條對角線
{
double s1=0,s2=0;
for(k=0;k<n;k++) //向兩邊找能夠延伸最遠的點
{
double tmp=multi(p[i],p[j],p[k]);
if(tmp>0)
s1=max(s1,tmp/2.0);
else
s2=max(s2,-tmp/2.0);
}
if(s1>0&&s2>0&&s1+s2>res)
res=s1+s2;
}
printf("%f\n",res);
}
return 0;
}