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; int a[n + 1] = {}; for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector <int> x;
for (int i = 1; i <= n; i++) x.push_back(i);
int mn = 1e9;
do {
bool flag = 1;
for (int i = 0; i + 1 < (int)x.size(); i++) {
flag &= x[i] - x[i + 1] <= 1;
}
if (flag) {
int pos[n + 1] = {}; for (int i = 0; i < n; i++) pos[x[i]] = i;
int cnt = 0;
for (int i = 1; i <= n; i++) {
for (int j = i - 1; j >= 1; j--) {
if (pos[a[i]] < pos[a[j]]) {
cnt++;
}
}
}
mn = min(mn, cnt);
}
} while (next_permutation(x.begin(), x.end()));
cout << mn << '\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... |