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

struct Fenwick {
    int n;
    vector<int> b;

    Fenwick(int n) : n(n), b(n + 1, INT_MAX) {}

    void update(int i, int v) {
        for (; i <= n; i += i & -i)
            b[i] = min(b[i], v);
    }

    int query(int i) {
        int r = INT_MAX;
        for (; i > 0; i -= i & -i)
            r = min(r, b[i]);
        return r;
    }
};

vector<int> findStarvation(vector<long long>& priorities) {
    int n = priorities.size();
    vector<int> ans(n, 0);

    vector<long long> c = priorities;
    sort(c.begin(), c.end());
    c.erase(unique(c.begin(), c.end()), c.end());

    auto id = [&](long long x) {
        return int(lower_bound(c.begin(), c.end(), x) - c.begin()) + 1;
    };

    Fenwick f(c.size());

    for (int i = n - 1; i >= 0; i--) {
        int p = id(priorities[i]);
        int j = f.query(p - 1);
        ans[i] = (j == INT_MAX ? 0 : j - i);
        f.update(p, i);
    }

    return ans;
}

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

    int n;
    if (!(cin >> n)) return 0;

    vector<long long> priorities(n);
    for (int i = 0; i < n; i++)
        cin >> priorities[i];

    vector<int> res = findStarvation(priorities);

    for (int i = 0; i < n; i++) {
        if (i) cout << ' ';
        cout << res[i];
    }
    cout << '\n';

    return 0;
}

All set for Cognizant ONCAMPUS ✓

=> 3pm ONCAMPUS Slots are available

All placement exams & interview Help available

Those who are looking for a top notch success DM now