题目大意:
题目链接:
洛谷:https://www.luogu.org/problem/P4035
BZOJ:https://www.lydsy.com/JudgeOnline/problem.php?id=1013
给出
n
n
n维中的
n
+
1
n+1
n+1个在
n
n
n维球体球面上的点,求出这个球的球心坐标。
思路:
题目下方有如下说明:
距离:设两个n为空间上的点
A
,
B
A, B
A,B的坐标为
(
a
1
,
a
2
,
.
.
.
,
a
n
)
,
(
b
1
,
b
2
,
.
.
.
b
n
)
(a_1,a_2,...,a_n),(b_1,b_2,...b_n)
(a1,a2,...,an),(b1,b2,...bn),则AB的距离定义为:
d
i
s
t
=
(
a
1
−
b
1
)
2
+
(
a
2
−
b
2
)
2
+
.
.
.
+
(
a
n
−
b
n
)
2
dist=\sqrt{(a_1-b_1)^2+(a_2-b_2)^2+...+(a_n-b_n)^2}
dist=(a1−b1)2+(a2−b2)2+...+(an−bn)2
那么我们就是要在
n
n
n维平面上找一个点
(
x
1
,
x
2
,
.
.
.
,
x
n
)
(x_1,x_2,...,x_n)
(x1,x2,...,xn),满足
∑
j
=
1
n
(
a
1
,
j
−
x
i
)
2
=
∑
j
=
1
n
(
a
2
,
j
−
x
i
)
2
=
.
.
.
=
∑
j
=
1
n
(
a
n
+
1
,
j
−
x
i
)
2
\sum^{n}_{j=1}(a_{1,j}-x_i)^2=\sum^{n}_{j=1}(a_{2,j}-x_i)^2=...=\sum^{n}_{j=1}(a_{n+1,j}-x_i)^2
j=1∑n(a1,j−xi)2=j=1∑n(a2,j−xi)2=...=j=1∑n(an+1,j−xi)2
把等号左右的式子相减,以第一个等号维例
∑
j
=
1
n
(
a
1
,
j
2
+
x
i
2
−
2
a
1
,
j
x
i
−
(
a
2
,
j
2
+
x
i
2
−
2
a
2
,
j
x
i
)
)
\sum^{n}_{j=1}(a_{1,j}^2+x_i^2-2a_{1,j}x_i-(a_{2,j}^2+x_i^2-2a_{2,j}x_i))
j=1∑n(a1,j2+xi2−2a1,jxi−(a2,j2+xi2−2a2,jxi))
∑
j
=
1
n
(
a
1
,
j
2
−
a
2
,
j
2
−
2
x
i
(
a
1
,
j
−
a
2
j
)
)
=
0
\sum^{n}_{j=1}(a_{1,j}^2-a_{2,j}^2-2x_i(a_{1,j}-a_{2_j}))=0
j=1∑n(a1,j2−a2,j2−2xi(a1,j−a2j))=0
∑
j
=
1
n
2
(
a
1
,
j
−
a
2
,
j
)
x
j
=
∑
j
=
1
n
(
a
1
,
j
2
−
a
2
,
j
2
)
\sum^{n}_{j=1}2(a_{1,j}-a_{2,j})x_j=\sum^{n}_{j=1}(a_{1,j}^2-a_{2,j}^2)
j=1∑n2(a1,j−a2,j)xj=j=1∑n(a1,j2−a2,j2)
然后就可以构造出增广矩阵
[
2
(
a
1
,
1
−
a
2
,
1
)
2
(
a
1
,
2
−
a
2
,
2
)
⋯
2
(
a
1
,
n
−
a
2
,
n
)
∣
∑
j
=
1
n
(
a
1
,
j
2
−
a
2
,
j
2
)
2
(
a
2
,
1
−
a
3
,
1
)
2
(
a
2
,
2
−
a
3
,
2
)
⋯
2
(
a
2
,
n
−
a
3
,
n
)
∣
∑
j
=
1
n
(
a
2
,
j
2
−
a
3
,
j
2
)
⋮
⋮
⋱
⋮
∣
⋮
2
(
a
n
,
1
−
a
n
+
1
,
1
)
2
(
a
n
,
2
−
a
n
+
1
,
2
)
⋯
2
(
a
n
+
1
,
n
−
a
n
,
n
)
∣
∑
j
=
1
n
(
a
n
,
j
2
−
a
n
+
1
,
j
2
)
]
\begin{bmatrix} &2(a_{1,1}-a_{2,1}) &2(a_{1,2}-a_{2,2}) &\cdots &2(a_{1,n}-a_{2,n}) &| & \sum^{n}_{j=1}(a_{1,j}^{2}-a_{2,j}^2)\\ &2(a_{2,1}-a_{3,1}) &2(a_{2,2}-a_{3,2}) &\cdots &2(a_{2,n}-a_{3,n}) &| & \sum^{n}_{j=1}(a_{2,j}^{2}-a_{3,j}^2)\\ &\vdots & \vdots & \ddots & \vdots & | & \vdots\\ &2(a_{n,1}-a_{n+1,1}) &2(a_{n,2}-a_{n+1,2}) & \cdots & 2(a_{n+1,n}-a_{n,n}) & | &\sum^{n}_{j=1}(a_{n,j}^{2}-a_{n+1,j}^2) \end{bmatrix}
⎣⎢⎢⎢⎡2(a1,1−a2,1)2(a2,1−a3,1)⋮2(an,1−an+1,1)2(a1,2−a2,2)2(a2,2−a3,2)⋮2(an,2−an+1,2)⋯⋯⋱⋯2(a1,n−a2,n)2(a2,n−a3,n)⋮2(an+1,n−an,n)∣∣∣∣∑j=1n(a1,j2−a2,j2)∑j=1n(a2,j2−a3,j2)⋮∑j=1n(an,j2−an+1,j2)⎦⎥⎥⎥⎤
md打的累死我了
然后套高斯消元的模板就好了
代码:
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N=15;
double a[N][N],b[N],c[N][N];
int n;
int main()
{
scanf("%d",&n);
for (int i=1;i<=n+1;i++)
for (int j=1;j<=n;j++)
scanf("%lf",&a[i][j]);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{
b[i]+=a[i][j]*a[i][j]-a[i+1][j]*a[i+1][j];
c[i][j]=(a[i][j]-a[i+1][j])*2.0;
}
for (int i=1;i<=n;i++)
{
for (int j=i;j<=n;j++)
if (fabs(c[j][i])>1e-8)
{
for (int k=1;k<=n;k++) swap(c[j][k],c[i][k]);
swap(b[j],b[i]);
break;
}
for (int j=1;j<=n;j++)
if (i!=j)
{
double rate=c[j][i]/c[i][i];
for (int k=1;k<=n;k++) c[j][k]-=c[i][k]*rate;
b[j]-=b[i]*rate;
}
}
for (int i=1;i<=n;i++)
printf("%0.3lf ",b[i]/c[i][i]);
return 0;
}