Submission #1453806

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define dep(i, a, n) for(int i = (a); i >= (n); i--)
#define mod 1e9+7

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

struct pa {
  int i;
  int num;

  bool operator<(const pa& right) const {
    return num == right.num ? i < right.i : num < right.num;
  }
};

int main() {
  int n, ans[100001] = {};
  cin >> n;
  pa a[n];
  rep(i, 0, n) {
    cin >> a[i].num;
    a[i].i = i;
  }
  sort(a, a + n);

  int z = a[n - 1].num, zz = z, m = 1145141919;
  dep(i, n - 2, 0) {
    if(z != a[i].num) {
      m = min(m, a[i + 1].i);
      ans[m] += (z - a[i].num) * (n - i - 1);
      zz = z;
      z = a[i].num;
    }
  }

  m = min(m, a[0].i);
  ans[m] += (zz - a[0].num) * n;

  rep(i, 0, n) {
    cout << ans[i] << endl;
  }
}

Submission Info

Judge Result