最小球覆盖 (退火算法)

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define PI acos(-1.0)
#define EXP exp(1)
#define pppp cout<='0'&&ch<='9')
        ret = ch - '0';
    while((ch=getchar())>='0'&&ch<='9')
        ret=ret*10+(ch-'0');
    return flag ? -ret : ret;
}
const int maxn=1050;
struct Point
{
    double x,y,z;
} A[maxn];
int n;
double dis(Point a,Point 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));
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0; iEPS)
    {
        for(int i=0; i

 

你可能感兴趣的:(计算几何)