F.cpp

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...) lower_bound(x)
#define ub(x...) upper_bound(x)

template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1 << 19;
int t[N << 1];

void update(int p, int v) { for (t[p |= N] = v; p >>= 1; ) t[p] = t[p << 1] + t[p << 1|1]; }
int sum(int l, int r) {
	int res = 0;
	for (l |= N, r |= N; l < r; l >>= 1, r >>= 1) {
		if (l & 1) res += t[l++];
		if (r & 1) res += t[--r];
	}
	return res;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n; cin >> n;
	vector<int> a(n);

	ll init = 0;
	for (auto &x : a) {
		cin >> x;
		init += sum(x, n);
		update(x, 1);
	}
	
	for (auto &x : a) {
		cout << init << '\n';
		init += n - x - 1;
		init -= x;
	}
}