#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using S = tuple<ll,int,int>;
using F = int;
constexpr S e(){return make_tuple(0, 1 << 30, 0);}
constexpr S op(S lhs, S rhs){
    auto [lsum, lmn, lsz] = lhs;
    auto [rsum, rmn, rsz] = rhs;
    return make_tuple(lsum + rsum, min(lmn, rmn), lsz + rsz);
}
constexpr S mapping(F f, S x){
    if(f >> 30) return x;
    auto [sm, mn, sz] = x;
    return make_tuple(sz * (ll)f, f, sz);
}
constexpr F composition(F af, F bf){return min(af, bf);}
constexpr F id(){return 1 << 30;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, idx = 0;
    cin >> n;
    vector<pair<int,int>> E(3 * n + 2);
    vector<S> tmp(n + 1);
    for(int i = 0; i <= n; i++) E[idx++] = make_pair(i, -1);
    for(int i = 0; i < n; i++){
        tmp[i] = make_tuple(n - i, n - i, 1);
        cin >> E[idx].first;
        E[idx].first = min(E[idx].first, n + 1);
        E[idx++].second = i;
    }
    for(int i = 0; i <= n; i++) E[idx++] = make_pair(i, n);
    atcoder::internal::csr<int> g(n + 2, E);
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(tmp);
    ll cur = n * (ll)(n + 1) / 2;
    for(int i = 0; i <= n; i++){
        for(int j = g.start[i]; j + 1 < g.start[i + 1]; j++){
            int l = g.elist[j] + 1, r = g.elist[j + 1] + 1, pr = n + 1 - r;
            r = min(r, seg.max_right(l, [&](S v){return get<1>(v) > pr;}));
            if(l < r) seg.apply(l, r, pr);
        }
        ll v = get<0>(seg.all_prod());
        cout << cur - v << '\n';
        cur = v;
    }
}