CodeForces - 340B Maximal Area Quadrilateral

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.

Input
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
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.

Examples
Input
5
0 0
0 4
4 0
4 4
2 3
Output
16.000000
Note
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.

题意：给你一个n，表示接下来有n个点。接下来n行，每行表示一个点的坐标(x,y)。在这n个点中选4个点，使得这4个点构成的四边形面积最大，并输出这个最大值。

思路：思路的关键是把这个四边形看作是两个同底的三角形，我们就可以枚举所有可能的对角线，然后再枚举所有的点，利用叉积判断点在对角线的上下方，求出最大值。本题还有一点就是两个向量的叉积数值上等于以这两个向量为邻边的平行四边形的面积，因此由这两个向量构成的三角形面积为该平行四边形面积的一半。

 #include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
struct node{
	double x;
	double y;
}a[309]; 
double judge(node p0,node p1,node p2)
{
    return (p1.x-p0.x)*(p2.y-p1.y)-(p2.x-p1.x)*(p1.y-p0.y);
}
int main()
{
	int n;
	double ans=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%lf%lf",&a[i].x,&a[i].y);
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
		{
			double ans1=0,ans2=0;
			for(int k=1;k<=n;k++)
			{
				double tmp=judge(a[i],a[j],a[k]);
				if(tmp>0)
					ans1=max(ans1,tmp/2.0);
				else if(tmp<0)
					ans2=max(ans2,(-tmp)/2.0);
			}
			if(ans1>0&&ans2>0)//这里不加判断条件会wa
				ans=max(ans,ans1+ans2);
		}
	printf("%lf\n",ans);
	return 0;
}