Submission #4714056

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

// BEGIN CUT HERE
struct DisjointSparseTable {
  using T = int;
  static T op(const T& x, const T& y) { return max(x, y); }

  const int n;
  VV<T> t;
  template<class Itr> DisjointSparseTable(Itr first, Itr last) :
    n(distance(first, last)), t(__lg(2 * n - 1), V<T>(first, last)) {
    for (int k = 1; k < (int) t.size(); ++k) {
      for (int i0 = 1 << k; i0 < n; i0 += 1 << k + 1) {
        for (int i = i0 + 1; i < min(i0 + (1 << k), n); ++i) {
          t[k][i] = op(t[k][i - 1], t[k][i]);
        }
        for (int i = i0 - 2; i >= i0 - (1 << k); --i) {
          t[k][i] = op(t[k][i], t[k][i + 1]);
        }
      }
    }
  }
  T acc(int l, int r) const {
    assert(l < r);
    if (l == --r) return t[0][l];
    int k = __lg(l ^ r);
    return op(t[k][l], t[k][r]);
  }
};
// END CUT HERE

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int n; cin >> n;
  V<> h(n); for (auto&& e : h) cin >> e;
  DisjointSparseTable st(begin(h), end(h));
  for (int i = 0; i < n; ++i) {
    int ok = i + 1, ng = n + 1;
    while (ng - ok > 1) {
      int m = ok + ng >> 1;
      (st.acc(i + 1, m) <= h[i] ? ok : ng) = m;
    }
    int res = ok - (i + 1);
    ng = -1, ok = i;
    while (ok - ng > 1) {
      int m = ng + ok >> 1;
      (st.acc(m, i) <= h[i] ? ok : ng) = m;
    }
    res += i - ok;
    cout << res << '\n';
  }
}

Submission Info

Judge Result