#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define repr2(i, l, r) for (int i = (r) - 1; i >= (l); i--)
#define range(a) a.begin(), a.end()

using namespace std;
using ll = long long;

bool chmin(ll &x, ll y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int N; cin >> N;
  vector<ll> A(N); rep(i, N) cin >> A[i];
  vector<ll> S(N + 1);
  rep(i, N) S[i + 1] = S[i] + A[i];
  vector<ll> ans(N, 1e18);
  vector<ll> dp(N, 1e18);
  auto f = [&](ll l, ll r) -> ll {
    if (l > r) swap(l, r);
    return (r - l + 1) * (r - l + 1) + S[r + 1] - S[l];
  };
  auto efs = [&](auto efs, int l, int r, int a, int b) -> void {
    if (l > r) return;
    int k = a;
    int m = (l + r) / 2;
    rep2(i, a, b + 1) {
      if (chmin(dp[m], f(m, i))) {
        k = i;
      }
    }
    efs(efs, l, m - 1, a, k);
    efs(efs, m + 1, r, k, b);
  };
  auto dfs = [&](auto dfs, int l, int r) -> void {
    if (l == r) {
      chmin(ans[l], f(l, l));
      return;
    }
    int m = (l + r) / 2;
    dfs(dfs, l, m);
    dfs(dfs, m + 1, r);
    rep2(i, l, m + 1) dp[i] = 1e18;
    efs(efs, l, m, m + 1, r);
    rep2(i, l, m) chmin(dp[i + 1], dp[i]);
    rep2(i, l, m + 1) chmin(ans[i], dp[i]);
    rep2(i, m + 1, r + 1) dp[i] = 1e18;
    efs(efs, m + 1, r, l, m);
    repr2(i, m + 1, r) chmin(dp[i], dp[i + 1]);
    rep2(i, m + 1, r + 1) chmin(ans[i], dp[i]);
  };
  dfs(dfs, 0, N - 1);
  rep(i, N) cout << ans[i] << '\n';
}