#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<long long> solve(int N, vector<int> H) {
vector<ll> pre(N);
pre[0] = H[0];
for(int i=1; i<N; i++) pre[i] = pre[i-1] + H[i];
vector<ll> ans(N,0);
stack<int> s;
for(int i=N-1; i>=0; i--) {
while(!s.empty() && H[i] < H[s.top()]) {
ans[s.top()] = pre[s.top()-1] - pre[i];
s.pop();
}
s.push(i);
}
while(!s.empty()) {
if(s.top() != 0) ans[s.top()] = pre[s.top()-1];
s.pop();
}
return ans;
}
int main() {
// your code goes here
int N;
cin >> N;
vector<int> H(N);
for(int i=0; i<N; i++) cin >> H[i];
vector<ll> ans = solve(N,H);
for(int i: ans) cout << i << " ";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2ZWN0b3I8bG9uZyBsb25nPiBzb2x2ZShpbnQgTiwgdmVjdG9yPGludD4gSCkgewoJdmVjdG9yPGxsPiBwcmUoTik7CglwcmVbMF0gPSBIWzBdOwoJZm9yKGludCBpPTE7IGk8TjsgaSsrKSBwcmVbaV0gPSBwcmVbaS0xXSArIEhbaV07Cgl2ZWN0b3I8bGw+IGFucyhOLDApOwoJc3RhY2s8aW50PiBzOwoJZm9yKGludCBpPU4tMTsgaT49MDsgaS0tKSB7CgkJd2hpbGUoIXMuZW1wdHkoKSAmJiBIW2ldIDwgSFtzLnRvcCgpXSkgewoJCQlhbnNbcy50b3AoKV0gPSBwcmVbcy50b3AoKS0xXSAtIHByZVtpXTsKCQkJcy5wb3AoKTsKCQl9CgkJcy5wdXNoKGkpOwoJfQoJd2hpbGUoIXMuZW1wdHkoKSkgewoJCWlmKHMudG9wKCkgIT0gMCkgYW5zW3MudG9wKCldID0gcHJlW3MudG9wKCktMV07CgkJcy5wb3AoKTsKCX0KCXJldHVybiBhbnM7Cn0KCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IE47CgljaW4gPj4gTjsKCXZlY3RvcjxpbnQ+IEgoTik7Cglmb3IoaW50IGk9MDsgaTxOOyBpKyspIGNpbiA+PiBIW2ldOwoJdmVjdG9yPGxsPiBhbnMgPSBzb2x2ZShOLEgpOwoJZm9yKGludCBpOiBhbnMpIGNvdXQgPDwgaSA8PCAiICI7CglyZXR1cm4gMDsKfQ==