Submission #1677672

---

Source Code Expand

//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#ifdef int
const int INF = (1LL<<30);
#else
const ll INF = (1LL<<60);
#endif
const double PI = 3.14159265359;
const double EPS = 1e-12;
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

int a[100010], cnt[100010], l[100010], ans[100010];

// xx, yy, zzにそれぞれ座圧する元の配列を突っ込むとx, y, zが座圧された配列で返ってくる
// zip[座圧前] = 座圧後、unzip[座圧後] = 座圧前
VL xx, x, unzip(100010);
unordered_map<int, int> zip;
void compress() {
  x = xx;
  sort(ALL(xx));
  xx.erase(unique(ALL(xx)), xx.end());
  REP(i, xx.size()) {zip[xx[i]] = i; unzip[i] = xx[i];}
  REP(i, x.size()) x[i] = zip[x[i]];
}

signed main(void)
{
  int n;
  cin >> n;
  REP(i, n) {
    cin >> a[i];
    xx.PB(a[i]);
  }
  compress();

  memset(l, -1, sizeof(l));
  int ma = 0;
  REP(i, n) {
    chmax(ma, (int)x[i]);
    cnt[x[i]]++;
    if(l[x[i]] == -1) l[x[i]] = i;
  }
  for(int i=ma; i>=1; --i) cnt[i-1] += cnt[i];
  int mi = INF;
  for(int i=ma; i>=0; --i) {
    chmin(mi, l[i]);
    l[i] = mi;
  }
  // REP(i, n) cout << x[i] << " "; cout << endl;
  // REP(i, ma+1) cout << cnt[i] << " "; cout << endl;
  REP(i, ma+1) {
    int tmp;
    if(i == 0) tmp = xx[i];
    else tmp = xx[i] - xx[i-1];
    ans[l[i]] += cnt[i] * tmp;
    // cout << cnt[i] << " " << tmp << endl;
    // REP(j, n) cout << ans[j] << " "; cout << endl;
  }

  REP(i, n) cout << ans[i] << endl;

  return 0;
}

Submission Info

Judge Result