This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector <int> nums(n), pos(n);
for (int i = 0; i < n; i++) {
cin >> nums[i];
pos[nums[i]] = i;
}
int ans = 1e9;
vector <int> nums2(n);
for (int i = 0; i < n; i++)
nums2[i] = i+1;
do {
int cost = 0;
bool valid = true;
for (int i = 0; i+1 < n; i++) {
if (nums2[i] >= nums2[i+1] + 2)
valid = false;
}
if (!valid)
continue;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
if (pos[nums2[i]] > pos[nums2[j]])
cost++;
}
}
ans = min(ans, cost);
} while (next_permutation(nums2.begin(), nums2.end()));
cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |