POJ 2079 凸包最大内接三角形

最新推荐文章于 2019-08-10 17:18:55 发布

_rabbit

最新推荐文章于 2019-08-10 17:18:55 发布

阅读量1.2k

点赞数

分类专栏：计算几何

本文链接：https://blog.csdn.net/xianxingwuguan1/article/details/25496715

版权

这篇博客探讨了POJ 2079题目的解决方案，该题目涉及计算几何中的凸包问题，主要内容是如何找到凸包上的点构成的最大内接三角形。文章可能包括输入输出格式说明、样例解析以及相应的算法代码实现。

摘要由CSDN通过智能技术生成

Triangle

Time Limit: 3000MS		Memory Limit: 30000K
Total Submissions: 8038		Accepted: 2375

Description

Given n distinct points on a plane, your task is to find the triangle that have the maximum area, whose vertices are from the given points.

Input

The input consists of several test cases. The first line of each test case contains an integer n, indicating the number of points on the plane. Each of the following n lines contains two integer xi and yi, indicating the ith points. The last line of the input is an integer −1, indicating the end of input, which should not be processed. You may assume that 1 <= n <= 50000 and −10 ⁴ <= xi, yi <= 10 ⁴ for all i = 1 . . . n.

Output

For each test case, print a line containing the maximum area, which contains two digits after the decimal point. You may assume that there is always an answer which is greater than