题目链接 题目大意是求三维空间可以包含$n$个点的最小圆半径。 如果有做过洛谷P1337就会发现这到题很模拟退火,所以就瞎搞一发。 $PS:$注意本题时限$3$秒。 1 #include<bits/stdc++.h> 2 using namespace std; 3 typedef long long ll; 4 const int maxn = 2111; 5 struct node {
In the 24th24^{\text{th}}24th century, there is a country somewhere in the universe, namely Country Meow. Due to advanced technology, people can easily travel in the 3-dimensional space. There are NNN cities in Country Meow. The iii-th city is located at
题意 三维空间有\(n\)个点,找到另外一个点,离所有点的最大距离最小。求这个距离。 题解 \(1\)、最小球覆盖,要找的点为球心。 \(2\)、模拟退火。 还是补一下模拟退火的介绍吧。 模拟退火有一个初始温度,温度越高,接受较差的解的可能性就越大。每次走完后,都会降低温度,使得接受较差解的可
https://codeforces.com/gym/101981/attachments 红书模板。 #include "bits/stdc++.h" using namespace std; const double esp = 1e-8; int npoint, nouter; struct Tpoint { double x, y, z; }; Tpoint pt[200000], outer[4], res; double radius, tmp; inl