#include<bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
const int M = 1000000007;
// const int M = 998244353;
const long long LM = 1LL << 60;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> p(n), idx(n);
    vector<long long> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> p[i];
        idx[p[i] - 1] = i;
    }
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<long long> imos(n + 1);
    for (int i = 0; i < n; ++i) {
        imos[i + 1] = imos[i] + p[i];
    }
    set<int> se;
    se.insert(-1);
    se.insert(n);
    for (int k = 0; k < n; ++k) {
        long long ans = 0;
        int i = idx[k];
        int l, r;
        {
            auto ptr = se.insert(i).first;
            l = *prev(ptr) + 1;
            r = *next(ptr);
        }
        int dl = i - l + 1;
        int dr = r - i;
        if (dl <= dr) {
            for (int j = l; j <= i; ++j) {
                auto ptr = upper_bound(imos.begin(), imos.begin() + r + 1, a[k] + imos[j]);
                ans += max(ptr - (imos.begin() + i) - 1, 0L);
            }
        }
        else {
            for (int j = i + 1; j <= r; ++j) {
                auto ptr = lower_bound(imos.begin() + l, imos.end(), imos[j] - a[k]);
                ans += max((imos.begin() + i) - ptr + 1, 0L);
            }
        }
        cout << ans << '\n';
    }


    return 0;
}