题意:11维度上有一个未知的点,现在已知12个点的坐标和他们到这个未知的点的距离,去求这个未知的点的坐标。
思路:
一个坐标可得出的信息:
(ai1-x1)^2 + (ai2-x2)^2 +(ai3-x1)^2 + (ai4-x2)^2 +(ai5-x1)^2 + (ai6-x2)^2 +(ai7-x1)^2 + (ai8-x2)^2 + (ai9-x2)^2 +(ai10-x1)^2 + (ai11-x2)^2 = dis^2
继续加油~
思路:
一个坐标可得出的信息:
(ai1-x1)^2 + (ai2-x2)^2 +(ai3-x1)^2 + (ai4-x2)^2 +(ai5-x1)^2 + (ai6-x2)^2 +(ai7-x1)^2 + (ai8-x2)^2 + (ai9-x2)^2 +(ai10-x1)^2 + (ai11-x2)^2 = dis^2
于是发现两个坐标的信息相减就可以得到一个一次方程组,11个未知数,所以列出11个方程足够。然后再进行高斯消元即可。
Code:
#include <algorithm>
#include <string.h>
#include <cstdio>
#include <cmath>
#define LL long long
using namespace std;
const int maxn = 15;
const double eps = 1e-12;
double matrix[maxn][maxn], a[maxn][maxn];
double x[maxn];
int n = 11;
inline int sgn(double x) {
return (x > eps) - (x < -eps);
}
void swap_row(int a, int b)
{
for(int i = 0; i <= n; ++i)
{
double tmp = matrix[a][i];
matrix[a][i] = matrix[b][i];
matrix[b][i] = tmp;
}
}
void swap_col(int a, int b)
{
for(int i = 0; i < n; ++i)
{
double tmp = matrix[i][a];
matrix[i][a] = matrix[i][b];
matrix[i][b] = tmp;
}
}
bool gauss()
{
int row, col, maxrow, i, j;
for(row = 0, col = 0; row < n && col < n; ++row)
{
maxrow = row;
for(i = row+1; i < n; ++i)
{
if(fabs(matrix[i][col]) > fabs(matrix[maxrow][col])) maxrow = i;
}
if(sgn(matrix[maxrow][col]) == 0)
{
++col;
--row;
continue;
}
if(maxrow != row) swap_row(row, maxrow);
for(i = row+1; i < n; ++i)
{
if(sgn(matrix[i][col]) != 0)
{
double tmp = matrix[i][col];
for(j = col; j <= n; ++j)
{
matrix[i][j] -= tmp/matrix[row][col]*matrix[row][j];
}
}
}
++col;
}
for(i = row; i < n; ++i)
if(sgn(matrix[row][n]) != 0) return false;
for(i = 0; i < n && i < n; ++i)
{
if(sgn(matrix[i][i]) == 0)
{
for(j = i+1; j < n; ++j)
if(sgn(matrix[i][j]) != 0)
{
swap_col(i, j);
break;
}
}
}
return true;
}
void calc_x()
{
for(int i = n-1; i >= 0; --i)
{
double tmp = matrix[i][n];
for(int j = i+1; j < n; ++j)
tmp = tmp-matrix[i][j]*x[j];
x[i] = tmp/matrix[i][i];
}
}
void init()
{
memset(matrix, 0, sizeof matrix);
}
void solve()
{
int t;
scanf("%d", &t);
while(t--)
{
init();
for(int i = 0; i < 12; ++i)
for(int j = 0; j < 12; ++j)
scanf("%lf", &a[i][j]);
for(int i = 1; i < 12; ++i)
{
for(int j = 0; j < 11; ++j)
{
matrix[i-1][j] = 2*(a[i][j]-a[i-1][j]);
matrix[i-1][n] += a[i][j]*a[i][j] - a[i-1][j]*a[i-1][j];
}
}
//移项会造成符号变化,常数列单独拿出来处理
for(int i = 1; i < 12; ++i) matrix[i-1][n] += a[i-1][n]*a[i-1][n]-a[i][n]*a[i][n];
gauss();
calc_x();
for(int i = 0; i < n-1; ++i)
printf("%.2f ", x[i]+eps);
printf("%.2f\n", x[n-1]+eps);
}
}
int main()
{
solve();
return 0;
}
继续加油~