Empty Convex Polygons（最大空凸包&&模板）

最新推荐文章于 2025-01-03 19:11:43 发布

原创

最新推荐文章于 2025-01-03 19:11:43 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

该问题要求在平面上给定的一组不重复点中，找到一个包含最多点的凸多边形，条件是这个多边形不能包含任何点在内部。目标是找到具有最大面积的这种凸多边形。输入包含多个测试用例，每个用例给出点的数量n（3≤n≤50），随后是每个点的坐标(x, y)，坐标范围在-1000到1000之间。输出应精确到小数点后一位，表示最大面积。题目提供了样例输入和输出，并提示最终面积可能是整数或半整数。解决方案的复杂度为O(n^3)。" 113973024,10042046,深入理解Mybatis：从基础到高级,"['mybatis', 'javaee', '持久层框架', '数据库操作']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Empty Convex Polygons

Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 581 Accepted Submission(s): 149

Problem Description

Given a set of distinct points S on a plane, we define a convex hole to be a convex polygon having any of thegiven points as vertices and not containing any of the given points in its interior. In addition to the vertices, other given points may lie on the perimeter of the polygon. We want to find a convex hole as above forming the convexpolygon with the largest area.

Input

This problem has several test cases.
The first line of input contains an integer t (1 ≤ t ≤ 100) indicating the total number of cases. For each test case,the first line contains the integer n (3