#include <bits/stdc++.h>
using namespace std;
typedef long long i64; 
const int N = 2e5 + 5; 

int n; 
int a[N], b[N]; i64 ans[N]; 

int C[N]; 
inline void add(int x, int k) { for (; x <= n; x += x & -x) C[x] += k; }
inline int sum(int x) { int r = 0; for (; x; x -= x & -x) r += C[x]; return r; }

int id[N], L[N]; 
vector<int> del[N]; 
inline void solve(void) {
    memset(C, 0, sizeof C); 
    for (int i = 1; i <= n; ++i) L[i] = sum(a[i] - 1), add(a[i], 1); 
    for (int i = 1; i <= n; ++i) id[a[i]] = i; 

    memset(C, 0, sizeof C); fill(del + 1, del + n + 1, vector<int>()); 
    for (int i = 1; i <= n; ++i) { // 从小到大考虑所有谷值
        int p = id[i], r = p; 
        for (int j = 17; j >= 0; --j) {
            int nr = r + (1 << j); 
            if (nr <= n && L[p] >= sum(nr) - L[p]) r = nr; 
        }
        del[r + 1].emplace_back(i); 
        add(p, 1); 
    }

    memset(C, 0, sizeof C); 
    i64 res = 0; 
    for (int i = 1; i <= n; ++i) {
        for (int x : del[i]) add(x, -1); // move to left
        res += sum(n) - sum(a[i] - 1); 
        ans[i] = min(ans[i], res); 
        add(a[i], 1); 
    }
}

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n; 
    for (int i = 1; i <= n; ++i) cin >> a[i], b[i] = a[i]; 
    sort(b + 1, b + n + 1); 
    for (int i = 1; i <= n; ++i) a[i] = lower_bound(b + 1, b + n + 1, a[i]) - b; 
    memset(ans, 0x3f, sizeof ans); solve(); 
    for (int i = 1; i <= n; ++i) a[i] = n + 1 - a[i]; 
    solve(); 
    for (int i = 1; i <= n; ++i) cout << ans[i] << '\n'; 
    return 0;
}