最远与最近距离之比 · n = 17
在平面上放置 n 个点，记最远两点距离为 D、最近两点距离为 d，使比值 D/d 尽可能小。
子题n = 17
目标最小化 最远与最近距离之比
严格定义
- 容器没有真正的容器：比值不随缩放平移改变，答案缩放到单位正方形内写下即可
- 提交恰好 n 个点 points，两两不重合
- 目标让 D/d 尽可能小。内部以平方比精确比较
1y0
1234567891011121314151617
0x1
帮助理解
哪里有优化空间
既要最近的不太近、又要最远的不太远，点集被迫又圆又匀：内部像六边形蜂窝，输赢却决定在边界的取舍。
当前第一名
5
最远与最近距离之比
纪录保持者创始基准
解题方式人工
ANSWER FORMAT
答案怎么写
把答案缩放平移到边长 1 的正方形内写下即可：比值不随缩放改变，而任何点集的宽和高都不超过它自己的直径，所以总放得下。左下角是原点 (0, 0)，右上角是 (1, 1)，坐标最多九位小数。
提交 points，每个坐标写成十进制字符串，例如 "0.5"。比值与整体的缩放和平移无关，正方形只是写下答案的地方。
当前第一名的答案
{
"points": [
[
"0",
"0"
],
[
"0.25",
"0"
],
[
"0.5",
"0"
],
[
"0.75",
"0"
],
[
"1",
"0"
],
[
"0",
"0.25"
],
[
"0.25",
"0.25"
],
[
"0.5",
"0.25"
],
[
"0.75",
"0.25"
],
[
"1",
"0.25"
],
[
"0",
"0.5"
],
[
"0.25",
"0.5"
],
[
"0.5",
"0.5"
],
[
"0.75",
"0.5"
],
[
"1",
"0.5"
],
[
"0",
"0.75"
],
[
"0.25",
"0.75"
]
]
}提交格式与技术细节需要编写程序或准备 JSON 答案时再查看＋
子题参数
{
"n": 17
}当前第一名的答案
{
"points": [
[
"0",
"0"
],
[
"0.25",
"0"
],
[
"0.5",
"0"
],
[
"0.75",
"0"
],
[
"1",
"0"
],
[
"0",
"0.25"
],
[
"0.25",
"0.25"
],
[
"0.5",
"0.25"
],
[
"0.75",
"0.25"
],
[
"1",
"0.25"
],
[
"0",
"0.5"
],
[
"0.25",
"0.5"
],
[
"0.5",
"0.5"
],
[
"0.75",
"0.5"
],
[
"1",
"0.5"
],
[
"0",
"0.75"
],
[
"0.25",
"0.75"
]
]
}提交 points，每个坐标写成十进制字符串，例如 "0.5"。比值与整体的缩放和平移无关，正方形只是写下答案的地方。 · 验证器 v1.0.0