#include <bits/stdc++.h>

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

const int MAXN = 200'001;

struct P {
    ll a, b;

    P() : a(0), b(0) {}
    P(ll x, ll y) : a(x), b(y) {}

    ll f(ll x) {
        return a*x+b;
    }
};

ll h[MAXN];
P tree[4*MAXN];

void add_line(int v, int tl, int tr, P p) {
    int tm = (tl + tr) / 2;

    bool lef = tree[v].f(tl) < p.f(tl);
    bool mid = tree[v].f(tm) < p.f(tm);

    if (mid) swap(tree[v], p);
    if (tl + 1 == tr) return;

    if (lef != mid) add_line(2*v, tl, tm, p);
    else add_line(2*v+1, tm, tr, p);
}

ll get_height(int v, int tl, int tr, int x) {
    if (tl + 1 == tr) return tree[v].f(x);
    int tm = (tl + tr) / 2;
    if (x < tm) return max(tree[v].f(x), get_height(2*v, tl, tm, x));
    else return max(tree[v].f(x), get_height(2*v+1, tm, tr, x));
}

void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; i++) cin >> h[i];
    for (int i = 2; i <= n; i++) {
        ll a = h[i] - h[i-1];
        ll b = h[i] - i * a;
        add_line(1, 1, n, {a, b});
    }
    for (int i = 1; i <= n; i++) {
        cout << max(0ll, get_height(1, 1, n, i)-h[i]) << " ";
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}