#include <bits/stdc++.h>
using namespace std;
int solve_perm(vector <int> v){
vector <pair<int,int>> tm;
for (int i=0; i<v.size(); i++){
tm.push_back({v[i],i});
}
int mn=INT_MAX;
do {
int ans=1;
for (int i=1; i<tm.size(); i++){
if (tm[i].first+1<tm[i-1].first){
ans=0;
}
}
if (ans==1){
ans=0;
for (int i=0; i<tm.size(); i++){
ans+=abs(tm[i].second-i);
}
mn=min(mn,ans/2);
}
} while (next_permutation(tm.begin(), tm.end()));
return mn;
}
int main(){
int n;
cin>>n;
vector <int> v(n);
for (int i=0; i<n; i++){
cin>>v[i];
}
cout<<solve_perm(v);
}
| # | 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... |