2018 ACM-ICPC 南京区域赛 现场赛 D题 最小求覆盖

gym题目链接

三维空间中，给你n个点，找到一个点与这n个点的最大距离最小 

模拟退火

#include 
using namespace std;
const double eps=1e-8;
struct point3D
{
    double x,y,z;
}a[105];
int n;
double dis(point3D a,point3D b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));
}
double solve()
{
    double step=10000,ans=1e30,mt;
    point3D z;
    z.x=z.y=z.z=0;
    int s=0;
    while(step>eps)
    {
        for(int i=0; i