Turbo

#include <iostream>
#include <algorithm>
#define F first
#define S second

using namespace std;

int n, z = 1, fr[131078], fi[131078];
pair<int, int> d[101010];

void add(int k, int o, int *f){
    for(; k<=z; k+=k&-k) f[k]+=o;
}

int sum(int k, int *f){
    int s = 0;
    for(; k; k-=k&-k) s += f[k];
    return s;
}

int main(){


    cin >> n;
    while(z<n) z*=2;

    for(int i=1; i<=n; i++){
        int x;
        cin >> x;
        d[i] = {x, i};
        add(i, 1, fr);
        add(i, 1, fi);
    }

    sort(d+1, d+n+1);

    int s = -n;
    for(int i=1; i != (n+1)/2; i+=s){

        int a = sum(i-1, fi);
        int b = sum(d[i].S-1, fr);

        cout << abs(a-b) << '\n';
        add(d[i].S, -1, fr);
        add(i, -1, fi);

        if(s>0) s--;
        else s++;
        s = -s;
    }

    cout << 0;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER