CF 340B Maximal Area Quadrilateral 叉积有向面积

Maximal Area Quadrilateral
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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: xiyi ( - 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.

Sample test(s)
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.



#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

const int INF=0xfffff;

struct Point{
    double x,y;
}vis[333];

Point operator - (Point A ,Point B){
    A.x-=B.x;
    A.y-=B.y;
    return A;
}

double Cross(Point A , Point B){
    return A.x*B.y - A.y*B.x;
}

double Area2(Point A ,Point B ,Point C){
    return Cross(B-A, C-A);
}


int main()
{
    int n;
    double s,ans,res;
    while(scanf("%d",&n)!=EOF)
    {
        int i,j,k;
        ans=0;
        for(i=0;i<n;i++)
            scanf("%lf%lf",&vis[i].x,&vis[i].y);
        for(i=0;i<n;i++)
        {
            for(j=i+1;j<n;j++)
            {
                double s1=-INF,s2=INF;//初始化注意就行了
                for(k=0;k<n;k++)
                {
                    if(k!=i&&k!=j)
                    {
                        s=Area2(vis[i],vis[j],vis[k])/2.0;
                        if(s>s1) s1=s;
                        if(s<s2) s2=s;
                    }
                }
                res=s1-s2;
                if(res<0)
                    res=-res;
                ans=max(ans,res);
            }
        }
        printf("%.9lf\n",ans);

    }

    return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值