网易堆棋子（%60通过率，超内存）

本文链接：https://blog.csdn.net/ccbka/article/details/77840001

本文介绍了一个算法，该算法旨在寻找一组坐标点，使得从这些点到已知多个目标点的距离之和最小。通过遍历所有可能的位置并计算总距离来找到最佳位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<vector>
#include<algorithm>
#include<climits>
#include<unordered_map>
using namespace std;
class point
{
public:
point(int x1, int y1):x(x1), y(y1){};
private:
int x;int y;
};
class solution
{
public:
vector<int> min_step(vector<int> x, vector<int> y, int n, unordered_map<int, pair<int, int>> points)
{
vector<int> dist(n, 0);//
vector<int> re(n,INT_MAX);//
int max_x = *max_element(x.begin(), x.end());
int min_x = *min_element(x.begin(), x.end());
int max_y = *max_element(y.begin(), y.end());
int min_y = *min_element(y.begin(), y.end());
int source = 0;
for (int i = min_x; i <= max_x; i++)
{
for (int j = min_y; j <= max_y; j++)
{
points[source] = pair<int, int>(i, j);
source++;
}
}
for (int i = 0; i < source; i++)
{
for (size_t k = 0; k < n; k++)
{
dist[k] = abs(points[i].first - x[k]) + abs(points[i].second - y[k]);//first用于获取第一个数据，second用于获取第二个数据
}
sort(dist.begin(), dist.end());
int temp = 0;
for (size_t k = 0; k < n; k++)
{
temp += dist[k];
if (temp < re[k])
re[k] = temp;
}
}

return re;
}
};
int main()
{
int n;
unordered_map<int,pair<int,int>> points;//pair数据结构的使用,pair用于使用在存储数据对的情况，即，类似于坐标点的数据
vector<int> re;
solution s;
cin >> n;
vector<int> x(n,0);
vector<int> y(n,0);
for (int i = 0; i < n; i++)
{
cin >> x[i];
}
for (int j = 0; j < n; j++)
{
cin >> y[j];
}
for (int i = 0; i < n; i++)
{
points[i] = pair<int, int>(x[i], y[i]);//pair的使用，用于存储坐标点
}
re = s.min_step(x, y, n, points);
for (int i = 0; i < n; i++)
cout << re[i]<<' ';
return 0;
}