萌新求助模拟退火

#include <bits/stdc++.h>
#include <time.h>
#define d 0.996
using namespace std;
int n;
double ans, ansx[20];
struct node {
	double a[20];
} p[20];
double getans(double r,double x[]){
	double res=0;
	for (int i = 1; i <= n + 1; i++) {
		double nx = 0;
		for (int j = 1; j <= n; j++) {
			double tmp = x[j] - p[i].a[j];
			nx += tmp * tmp;
		}
		res += abs(sqrt(nx)-r);
	}
	return res;
}
double cal(double x[]) {
	double res = 0;
	for (int i = 1; i <= n + 1; i++) {
		double nx = 0;
		for (int j = 1; j <= n; j++) {
			double tmp = x[j] - p[i].a[j];
			nx += tmp * tmp;
		}
		res += sqrt(nx);
	}
	return res / (n + 1.0);
}

void SA() {
	double x[20];
	for (int i = 1; i <= n; i++) {
		x[i] = ansx[i];
	}
	double t = 2000;
	while (t > 1e-15) {
		double X[20];
		for(int i=1;i<=n;i++){
			X[i]=x[i]+((rand()<<1)-RAND_MAX)*t;
		}
		double r= cal(X);
		double now=getans(r,X);
		double delta=now-ans;
		if(delta<0){
			ans=now;
			for(int i=1;i<=n;i++){
				x[i]=ansx[i]=X[i];
			}
		}
		else if(exp(-delta/t)*RAND_MAX>rand()){
			for(int i=1;i<=n;i++){
				x[i]=X[i];
			}
		}
		t *= d;
	}
}

int main() {
	srand(time(0));
	scanf("%d", &n);
	for (int i = 1; i <= n + 1; i++) {
		for (int j = 1; j <= n; j++) {
			scanf("%lf", &p[i].a[j]);
			ansx[j] += p[i].a[j];
		}
	}
	ans = 1e8;
	for (int i = 1; i <= n; i++) {
		ansx[i] /= (n + 1);
	}
	SA();
	SA();
	SA();
	SA();
	SA();
	SA();
	SA();
	for (int i = 1; i <= n; i++) {
		printf("%0.3lf ", ansx[i]);
	}
	return 0;
}