Submission #1519706

---

Source Code Expand

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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int main() {
    int N;
    cin >> N;
    map<ll, set<ll>> m;
    ll sum = 0;
    for(int i = 0; i < N; ++i) {
        int a;
        cin >> a;
        m[-a].insert(i);
        sum += a;
    }
    m[0].insert(-1);

    ll cnt = 0;
    vector<ll> res(N);
    for(auto it = m.begin(); it != m.end(); ++it) {
        if(it->first == 0) {
            break;
        }
        cnt += it->second.size();
        ll mi = *(it->second.begin());
        ll next = std::next(it)->first;
        res[mi] += cnt * (next - it->first);
        sum -= cnt * (next - it->first);
    }

    assert(cnt == N && sum == 0);
    for(auto x : res) {
        cout << x << endl;
    }
}

Submission Info

Judge Result