Submission #1516837

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
int abs(int x){
if(x<0)
    return x*-1;
else
    return x;
}
int main(){
int n;
cin>>n;
int i,j;
pair<int,int> a[n+1];
for(i=1;i<=n;i++){
    int g;
    cin>>g;
    a[i]=mp(g,i);

}
sort(a+1,a+n+1);


int cn1=0;
int cn2=0;
for(i=n;i>=1;i--){

   int x=abs(i-a[i].second);
if(x%2){

    if(a[i].second%2)
    cn1++;
else
    cn2++;

}

}

int ans=min(cn1,cn2);
int x=abs(cn1-cn2);
ans+=x;
if(x%2)
    ans++;

cout<<ans<<endl;



return 0;
}

Submission Info

Judge Result