SHELF (Fenwick Tree)

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 1e5 + 5;

int n;
ll fen[N];

void update(int p, int val){
    for(int i = p; i <= n; i += i & -i)
        fen[i] += val;
}
ll sum(int p) {
    ll ans = 0;
    for(int i = p; i; i -= i & -i)
        ans += fen[i];
    return ans;
}

int main()
{
    //freopen("in.txt", "r", stdin);
    freopen("SHELF.inp", "r", stdin);
    freopen("SHELF.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    cin >> n;
    for(int i = 1; i <= n; ++i) {
        int x;
        cin >> x;
        update(i, x);
    }

    int m;
    cin >> m;
    for(int i = 1; i <= m; ++i) {
        int x; cin >> x;

        ll left = sum(x - 1);
        ll right = sum(n) - sum(x);
        cout << min(left, right) << ' ';
        update(x, 1);
    }

    return 0;
}