Submission #845177

---

Source Code Expand

//In the name of Allah
#include <bits/stdc++.h>
using namespace std; 

const int maxN = 100 * 1000 + 100; 
int a[maxN]; 
int b[maxN]; 

int main() { 
	int n; cin >> n;
	for( int i = 0 ; i < n ; i++ ) { 
		cin >> a[i]; 
		b[i] = a[i]; 
	}
	sort( b , b + n ); 
	int B = 0 , W = 0; 
	for( int i = 0 ; i < n ;i++ ) { 
		a[i] = lower_bound( b , b + n , a[i] ) - b; 
		if( abs( a[i] - i ) % 2 == 1 ) { 
			if( i % 2 == 0 ) B++; 
			else W++; 
		}
	}
	cout << B << endl;
}

Submission Info

Judge Result