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>h(n);
for(int i=0;i<n;i++)cin>>h[i];
vector<int>pos(n+1);
for(int i=0;i<n;i++){
pos[h[i]]=i;
}
int swaps=0;
for(int i=0;i<n;i++){
for(int j=0;j<n-1-i;j++){
if((h[j]+2*pos[h[j]])>(h[j+1]+2*pos[h[j+1]])){
swap(pos[h[j]],pos[h[j+1]]);
swaps++;
}
}
}
cout<<swaps<<"\n";
return 0;
}
# | 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... |