A9089 | Maximal Area Quadrilateral
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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: $x_{i}$ , $y_{i}$ $(-1000<=x_{i},y_{i}<=1000)$ — the cartesian coordinates of $i$ th 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}$ .
输入输出样例
输入 #1
5 0 0 0 4 4 0 4 4 2 3
输出 #1
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$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted