#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
int n;
int p[200020];
ll a[200020];
ll ans[200020];
void solve(int l, int r){
    if(l==r){
        if(p[l]<=a[p[l]]) ans[p[l]]++;
        return;
    }
    int m=(l+r)/2;
    solve(l, m);
    solve(m+1, r);
    vector<int> vl1(m-l+2), vr1(r-m+1);
    vector<ll> vl2(m-l+2), vr2(r-m+1);
    vl1[0]=1e9, vr1[0]=1e9;
    for(int i=m; i>=l; i--){
        vl1[m-i+1]=min(vl1[m-i], p[i]);
        vl2[m-i+1]=vl2[m-i]+p[i];
    }
    for(int i=m+1; i<=r; i++){
        vr1[i-m]=min(vr1[i-m-1], p[i]);
        vr2[i-m]=vr2[i-m-1]+p[i];
    }
    for(int i=1; i<=m-l+1; i++){
        int mn=vl1[i];
        ll s=vl2[i];
        int k1=lower_bound(vr1.begin(), vr1.end(), mn, greater<int>())-vr1.begin();
        int k2=upper_bound(vr2.begin(), vr2.end(), a[mn]-s)-vr2.begin();
        if(min(k1, k2)>0) ans[mn]+=min(k1, k2)-1;
    }
    for(int i=1; i<=r-m; i++){
        int mn=vr1[i];
        ll s=vr2[i];
        int k1=lower_bound(vl1.begin(), vl1.end(), mn, greater<int>())-vl1.begin();
        int k2=upper_bound(vl2.begin(), vl2.end(), a[mn]-s)-vl2.begin();
        if(min(k1, k2)>0) ans[mn]+=min(k1, k2)-1;
    }
}
int main()
{
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>p[i];
    }
    for(int i=1; i<=n; i++){
        cin>>a[i];
    }
    solve(1, n);
    for(int i=1; i<=n; i++){
        cout<<ans[i]<<endl;
    }
    return 0;
}