#include <cstdio>
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
int arr[60] = {0};
for (int i = 0; i < n; i++)
scanf("%d", &arr[i]);
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (arr[i] > arr[j])
arr[55]++;
printf("Optimal train swapping takes %d swaps.\n", arr[55]);
}
return 0;
}
UVA 299 Train Swapping
最新推荐文章于 2023-09-08 16:23:42 发布