#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    vi p(n);
    cin >> p;
    vi l(n, -1), r(n, n);

    vi pos(n + 1);
    FOR (i, n) {
        pos[p[i]] = i;
    }

    vi s;
    FOR (i, n) {
        while (s.size() && p[s.back()] > p[i]) {
            s.pop_back();
        }
        if (s.size()) {
            l[i] = s.back();
        }
        s.app(i);
    }

    s.clear();
    for (int i= n - 1; i >= 0; --i) {
        while (s.size() && p[s.back()] > p[i]) {
            s.pop_back();
        }
        if (s.size()) {
            r[i] = s.back();
        }
        s.app(i);        
    }

    vi pref(n + 1);
    FOR (i, n) {
        pref[i + 1] = pref[i] + p[i];
    }

    FORN (x, n) {
        int up;
        cin >> up;
        int i = pos[x];
        int ans = 0;
        if (i - l[i] < r[i] - i) {
            for (int L = l[i] + 1; L <= i; ++L) {
                //pref[r] - pref[l] <= up
                ans += upper_bound(pref.begin() + i + 1, pref.begin() + r[i] + 1, up + pref[L]) - (pref.begin() + i + 1);
            }
        }
        else {
            for (int R = i; R < r[i]; ++R) {
                //pref[r + 1] - pref[l] <= up
                //pref[r + 1] - up <= pref[l]
                int lll = l[i];
                int rrr = i + 1;
                while (lll < rrr - 1) {
                    int m = (lll + rrr) / 2;
                    if (pref[R + 1] - pref[m] > up) {
                        lll = m;
                    }
                    else {
                        rrr = m;
                    }
                }
                ans += i + 1 - rrr;
            }
        }
        cout << ans << endl;
    }
}