#include using namespace std; #define rep(i,a,b) for(int i=a;i data; int seg_size; LazySegTreeAddSetSum(int n) { for (seg_size = 1; seg_size < n; seg_size *= 2); data.assign(seg_size * 2, Data()); } ll set(int a, int b, ll x, int l = 0, int r = -1, int k = 0) { if (r == -1) r = seg_size - 1; if (a <= l && r <= b) { data[k].set_data(x, 0); return data[k].calc_sum(l, r); } if (r < a || b < l) return data[k].calc_sum(l, r); if (data[k].valset) { data[k * 2 + 1].set_data(data[k].val, data[k].add); data[k * 2 + 2].set_data(data[k].val, data[k].add); } data[k].add = 0; data[k].valset = false; data[k].sum = set(a, b, x, l, (l + r) / 2, k * 2 + 1) + set(a, b, x, (l + r) / 2 + 1, r, k * 2 + 2); return data[k].calc_sum(l, r); } ll add(int a, int b, ll x, int l = 0, int r = -1, int k = 0) { if (r == -1) r = seg_size - 1; if (a <= l && r <= b) { data[k].add += x; return data[k].calc_sum(l, r); } if (r < a || b < l) return 0; if (data[k].valset) { data[k * 2 + 1].set_data(data[k].val, 0); data[k * 2 + 2].set_data(data[k].val, 0); data[k].valset = false; } data[k].sum = add(a, b, x, l, (l + r) / 2, k * 2 + 1) + add(a, b, x, (l + r) / 2 + 1, r, k * 2 + 2); return data[k].calc_sum(l, r); } ll query(int a, int b, int l = 0, int r = -1, int k = 0) { if (r == -1) r = seg_size - 1; if (r < a || b < l) return 0; if ((a <= l && r <= b) || data[k].valset) return data[k].calc_sum(max(a, l), min(b, r)); return query(a, b, l, (l + r) / 2, k * 2 + 1) + query(a, b, (l + r) / 2 + 1, r, k * 2 + 2) + data[k].add * (min(b, r) - max(a, l) + 1); } }; //----------------------------------------------------------------------------------- int N; int A[101010]; //----------------------------------------------------------------------------------- int main() { cin >> N; rep(i, 0, N) scanf("%d", &A[i]); LazySegTreeAddSetSum st(N); rep(i, 0, N) st.set(i, i, A[i]); map> m; rep(i, 0, N) m[A[i]].push_back(i); for (auto p : m) { int i = p.first; auto v = p.second; int mi, ma; mi = ma = v[0]; for (int j : v) mi = min(mi, j), ma = max(ma, j); st.set(mi, ma, i); } rep(i, 0, N) printf("%lld ", st.query(i, i)); printf("\n"); }