#include "iostream"
#include "algorithm"
#include "fstream"
using namespace std;
//将大于a[low]的元素置其右,小于a[low]的元素置其右
//最后将a[low]放在合适的位置,并返回其下标
int partition(int a[], int low, int heigh)
{
int temp = a[low];
int l = low;
int h = heigh + 1;
while(true)
{
while(a[++l] < temp && l<h);
while(a[--h] > temp && l<h);
if(l >= h)
break;
swap(a[l], a[h]);
}
a[l] = a[h];
a[h] = temp;
return h;
}
//返回a[low, heigh]中第k小元素
int select(int a[], int low, int heigh, int k)
{
int mid = partition(a, low, heigh);
if(mid == k)
return a[mid];
else if(mid > k)
return select(a, low, mid-1, k);
else
return select(a, mid+1, heigh, k-mid+1);
}
//计算a[low, heigh]中各元素到y的距离之和
int dis(int a[], int low, int heigh, int y)
{
int sum = 0;
for(int i=low; i<=heigh; i++)
sum += abs(a[i] - y);
return sum;
}
int main()
{
ifstream fin("solder.txt");
int n;
fin >> n;
int *x = new int[n+1];
int *y = new int[n+1];
cout << "士兵个数为:" << n;
cout << "\n各个士兵的坐标为:\n";
for(int i=1; i<=n; i++)
{
fin >> x[i] >> y[i];
cout << x[i] << " " << y[i] << endl;
}
sort(x+1, x+n+1); //对x坐标排序
/*如何确定X轴方向上的最佳的“最终位置”?
共n个士兵
他们相应的X轴坐标为:X0,X1,X2 …… …… Xn-1
设,士兵需要移动到的“最终位置”的X轴坐标值为:k,k+1,k+2 …… …… k+(n-1)
则所求最优步数S=|X0-k|+|X1- (k+1) |+|X2-(k+2)|+ …… +|Xn-1-(k+(n-1))|
经过变形S=|X0-k|+|(X1-1)-k|+|(X2-2)-k|+ …… …… +|(Xn-1-(n-1))-k|
*/
for(i=0; i<n; i++)
x[i] -= i; //最终位置
int xk = select(x, 1, n, (1+n)/2);
int yk = select(y, 1, n, (1+n)/2);
int sumx = dis(x, 1, n, xk);
int sumy = dis(y, 1, n, yk);
cout << "最小移动步数为:" << sumx + sumy << endl;
return 0;
}
士兵站队问题
最新推荐文章于 2021-12-28 23:54:50 发布