poj 1981 Circle and Points(固定半径的圆能覆盖的最多点数)

最新推荐文章于 2025-04-27 14:23:12 发布

Pira

最新推荐文章于 2025-04-27 14:23:12 发布

阅读量4.4k

点赞数 1

CC 4.0 BY-SA版权

分类专栏：计算几何文章标签： distance each character integer input 算法

本文链接：https://blog.youkuaiyun.com/fp_hzq/article/details/7972428

解决POJ 1981题，探讨如何确定固定半径为1的圆能覆盖平面上n个点的最大数量。文章讨论了O(n^3)的枚举算法和更优的O(n^2 log n)算法，后者通过枚举点和相交弧进行计算，实现覆盖次数最多的弧段确定答案。

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

Circle and Points

Time Limit: 5000MS		Memory Limit: 30000K
Total Submissions: 5342		Accepted: 1865
Case Time Limit: 2000MS

Description

You are given N points in the xy-plane. You have a circle of radius one and move it on the xy-plane, so as to enclose as many of the points as possible. Find how many points can be simultaneously enclosed at the maximum. A point is considered enclosed by a circle when it is inside or on the circle.