// >>> TEMPLATES #include using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; #define int ll #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep1(i, n) for (int i = 1; i <= (int)(n); i++) #define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i, n) for (int i = (int)(n); i >= 1; i--) #define loop(i, a, B) for (int i = a; i B; i++) #define loopR(i, a, B) for (int i = a; i B; i--) #define all(x) begin(x), end(x) #define allR(x) rbegin(x), rend(x) #define rng(x, l, r) begin(x) + (l), begin(x) + (r) #define pb push_back #define eb emplace_back #define fst first #define snd second template constexpr auto mp(A &&a, B &&b) { return make_pair(forward(a), forward(b)); } template constexpr auto mt(T&&... x) { return make_tuple(forward(x)...); } template auto constexpr inf_ = numeric_limits::max()/2-1; auto constexpr INF32 = inf_; auto constexpr INF64 = inf_; auto constexpr INF = inf_; #ifdef LOCAL #include "debug.hpp" #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template struct pque : priority_queue, Comp> { vector &data() { return this->c; } void clear() { this->c.clear(); } }; template using pque_max = pque>; template using pque_min = pque>; template ::value, int> = 0> ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template ::value, int> = 0> ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template ())), class = typename enable_if::value>::type> istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; } template ostream& operator<<(ostream& os, pair const& p) { return os << p.first << " " << p.second; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward(f)) {} template constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward(x)...); } }; struct MakeFixPoint { template constexpr auto operator|(F&& f) const { return FixPoint(forward(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template struct vec_impl { using type = vector::type>; template static type make_v(size_t n, U&&... x) { return type(n, vec_impl::make_v(forward(x)...)); } }; template struct vec_impl { using type = T; static type make_v(T const& x = {}) { return x; } }; template using vec = typename vec_impl::type; template auto make_v(Args&&... args) { return vec_impl::make_v(forward(args)...); } template void quit(T const& x) { cout << x << endl; exit(0); } template constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; } template constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits::value_type{}); } template int sz(T const& x) { return x.size(); } template int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); } template int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); } constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; } constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); } constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); } constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 }; constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 }; constexpr int popcnt(ll x) { return __builtin_popcountll(x); } mt19937_64 seed_{random_device{}()}; template Int rand(Int a, Int b) { return uniform_int_distribution(a, b)(seed_); } i64 irand(i64 a, i64 b) { return rand(a, b); } // [a, b] u64 urand(u64 a, u64 b) { return rand(a, b); } // template void shuffle(It l, It r) { shuffle(l, r, seed_); } vector &operator--(vector &v) { for (int &x : v) --x; return v; } vector &operator++(vector &v) { for (int &x : v) ++x; return v; } // <<< // >>> segment tree template struct Segtree : Handler { using Value = typename Handler::Value; using Handler::unit; // () -> Value using Handler::merge; // (Value, Value) -> Value vector v; int n; Segtree() {} template Segtree(T&&... x) { init(forward(x)...); } template ()(0))> void init(int n, F gen) { assert(n >= 0); this->n = n; v.resize(2*n, unit()); for (int i = 0; i < n; i++) v[n+i] = gen(i); for (int i = n-1; i >= 1; i--) v[i] = merge(v[i<<1], v[i<<1|1]); } void init(int n) { init(n, [&](int) { return unit(); }); } void init(int n, Value const& x) { init(n, [&](int) { return x; }); } void init(vector const& v) { init(v.size(), [&](int i) { return v[i]; }); } int size() const { return n; } void set(int i, Value const& x) { assert(0 <= i); assert(i < size()); i += n; v[i] = x; while (i >>= 1) v[i] = merge(v[i<<1], v[i<<1|1]); } Value operator[](int i) const { return get(i); } Value get(int i) const { assert(0 <= i); assert(i < size()); return v[n + i]; } // [l, r) Value get(int l, int r) const { assert(0 <= l); assert(l <= r); assert(r <= size()); Value x = unit(), y = unit(); for (l += n, r += n; l < r; l >>= 1, r >>= 1) { if (l&1) x = merge(x, v[l++]); if (r&1) y = merge(v[--r], y); } return merge(x, y); } template int max_right(int l, F f) { assert(0 <= l); assert(l <= size()); assert(f(unit())); l += n; const int r = size() << 1; Value x = unit(); while (true) { if (l == r) return size(); int k = __builtin_ctz(l | 1 << __lg(r - l)); auto y = merge(x, v[l >> k]); if (not f(y)) { l >>= k; break; } x = y, l += 1 << k; } while (l < size()) { auto y = merge(x, v[l <<= 1]); if (f(y)) x = y, l++; } return l - size(); } template int min_left(int r, F f) { assert(0 <= r); assert(r <= size()); assert(f(unit())); r += n; const int l = size(); Value x = unit(); while (true) { if (l == r) return 0; int k = __builtin_ctz(r | 1 << __lg(r - l)); auto y = merge(v[(r >> k) - 1], x); if (not f(y)) { r >>= k; --r; break; } x = y, r -= 1 << k; } while (r < size()) { r = r << 1 | 1; auto y = merge(v[r], x); if (f(y)) x = y, r--; } return r + 1 - size(); } vector dat() const { vector ret(size()); for (int i = 0; i < size(); i++) ret[i] = get(i); return ret; } }; // <<< struct Min { using Value = int; constexpr static Value unit() { return INF; } constexpr static Value merge(Value const& x, Value const& y) { return min(x, y); } }; struct Max { using Value = int; constexpr static Value unit() { return -INF; } constexpr static Value merge(Value const& x, Value const& y) { return max(x, y); } }; int32_t main() { int n; cin >> n; vector p(n), a(n); cin >> p >> a; --p; vector s(n+1); rep (i, n) s[i+1] = s[i] + (p[i] + 1); Segtree seg(p); vector ans(n); rep (i, n) { int x = p[i]; int l = seg.min_left(i, [&](int mi) { return mi >= x; }); int r = seg.max_right(i, [&](int mi) { return mi >= x; }); dump(x, l, r); if (abs(i-l) < abs(r-i)) { say("L"); loop (j, l, <= i) { int L = s[i+1] - s[l]; if (L > a[x]) continue; int rest = a[x] - L; int pos = min(ubd(s, rest + s[i+1])-1, r); dump(j, rest, pos, pos-i); ans[x] += pos-i; } } else { say("R"); loop (j, i+1, <= r) { int R = s[j] - s[i]; if (R > a[x]) continue; int rest = a[x] - R; int pos = max(lbd(s, s[i] - rest), l); dump(j, rest, pos, i-pos+1); ans[x] += i-pos+1; } } } rep (i, n) cout << ans[i] << '\n'; }