题解 [JSOI2008][LuoguP4035] 球形空间产生器

link

设球心的坐标为 $(x_1,x_2,...,x_n)$，可以列出方程：
$$\{\begin{array}{l}(a_{1,1}-x_1{)}^2+(a_{1,2}-x_2{)}^2+...+(a_{1,n}-x_n{)}^2=k\\ (a_{2,1}-x_1{)}^2+(a_{2,2}-x_2{)}^2+...+(a_{2,n}-x_n{)}^2=k\\ ...\\ (a_{n+1,1}-x_1{)}^2+(a_{n+1,2}-x_2{)}^2+...+(a_{n+1,n}-x_n{)}^2=k\end{array}$$

是个二次方程，还有个 $k$，不太可解。把方程展开得：
$$\{\begin{array}{l}({x_1}^2+{x_2}^2+...+{x_n}^2)-2(x_1{a}_{1,1}+x_2{a}_{1,2}+...+x_n{a}_{1,n})+({a_{1,1}}^2+{a_{1,2}}^2+...+{a_{1,n}}^2)=k\\ ({x_1}^2+{x_2}^2+...+{x_n}^2)-2(x_1{a}_{2,1}+x_2{a}_{2,2}+...+x_n{a}_{2,n})+({a_{2,1}}^2+{a_{2,2}}^2+...+{a_{2,n}}^2)=k\\ ...\\ ({x_1}^2+{x_2}^2+...+{x_n}^2)-2(x_1{a}_{n+1,1}+x_2{a}_{n+1,2}+...+x_n{a}_{n+1,n})+({a_{n+1,1}}^2+{a_{n+1,2}}^2+...+{a_{n+1,n}}^2)=k\end{array}$$

设 $K_i=[({a_{i,1}}^2+{a_{i,2}}^2+...+{a_{i,n}}^2)-({a_{i+1,1}}^2+{a_{i+1,2}}^2+...+{a_{i+1,n}}^2)]÷2$ ，
$n+1$ 个方程，两两相减可得：
$$\{\begin{array}{l}{x}_1(a_{1,1}-a_{2,1})+x_2(a_{1,2}-a_{2,2})+...+x_n(a_{1,n}-a_{2,n})=K_1\\ x_1(a_{2,1}-a_{3,1})+x_2(a_{2,2}-a_{3,2})+...+x_n(a_{2,n}-a_{3,n})=K_2\\ ...\\ x_1(a_{n,1}-a_{n+1,1})+x_2(a_{n,2}-a_{n+1,2})+...+x_n(a_{n,n}-a_{n+1,n})=K_n\end{array}$$

用高斯消元求解。高斯消元可见：我的文章。

//P4035
#include <bits/stdc++.h>
using namespace std;

const double eps = 1e-6;
const int N = 15;
double a[N][N], mat[N][N], sum[N];
int n; 

int gauss(){
	int c, r;//c列，r行 
	for(c = 0, r = 0; c < n; ++ c){
		int tmp = r;
		//找到绝对值最大的行，为了把 0 的行移到最下面去不管它，最后判断 
		for(int i = r; i < n; ++ i) if(fabs(mat[i][c]) > fabs(mat[tmp][c])) tmp = i;
		if(fabs(mat[tmp][c]) < eps) continue;
		for(int i = c; i <= n; ++ i) swap(mat[tmp][i], mat[r][i]);
		for(int i = n; i >= c; -- i) mat[r][i] /= mat[r][c];
		for(int i = r+1; i < n; ++ i) if(fabs(mat[i][c]) > eps)
			for(int j = n; j >= c; -- j) mat[i][j] -= mat[r][j] * mat[i][c];
		++ r;
	}
	if(r < n){
		for(int i = r; i < n; ++ i) if(fabs(mat[i][n]) > eps) return 2;//no solution
		return 1;//infinity
	}	
	for(int i = n-1; i>=0; -- i) for(int j = i+1; j < n; ++ j) mat[i][n] -= mat[i][j] * mat[j][n];
	return 0;
}

int main(){
	scanf("%d", &n);
	
	for(int i = 0; i <= n; ++ i)
		for(int j = 0; j < n; ++ j)
			scanf("%lf", &a[i][j]), sum[i] += a[i][j]*a[i][j];

	for(int i = 0; i < n; ++ i)
		for(int j = 0; j < n; ++ j)
			mat[i][j] = (a[i][j] - a[i+1][j])*2;
	for(int i = 0; i < n; ++ i)
		mat[i][n] = (sum[i] - sum[i+1]);
	gauss();
	
	for(int i = 0; i < n; ++ i)
		printf("%.3lf ", mat[i][n]);
	return 0;
}

当然这题还可以用模拟退火解，这里就不再讲解。