#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    int N;cin>>N;
    vector<int> P(N);
    for(auto &x:P){
        cin>>x;x--;
    }
    vector<ll> A(N);
    cin>>A;

    vector<ll> S(N+1,0);
    for(int i=0;i<N;i++) S[i+1]=S[i]+P[i];

    auto get=[&](int l,int r){
        return S[r]-S[l]+r-l;
    };

    vector<int> pos(N,0);
    rep(i,N) pos[P[i]]=i;

    set<int> st;
    st.insert(-1);
    st.insert(N);

    for(int k=0;k<N;k++){
        ll ans=0;
        int p=pos[k];

        int l=*prev(st.lower_bound(p));
        int r=*st.lower_bound(p);

        if(r-p>p-l){
            for(int i=p;i>l;i--){
                int lw=p,hi=r-1,res=-1;
                while(lw<=hi){
                    int mid=(lw+hi)/2;
                    ll sum=get(i,mid+1);
                    if(sum<=A[k]) res=mid,lw=mid+1;
                    else          hi=mid-1;
                }
                if(res>=0) ans+=1ll+res-p;
            }
        }else{
            for(int i=p;i<r;i++){
                int lw=l+1,hi=p,res=-1;
                while(lw<=hi){
                    int mid=(lw+hi)/2;
                    ll sum=get(mid,i+1);
                    if(sum<=A[k]) res=mid,hi=mid-1;
                    else          lw=mid+1;
                }
                if(res>=0) ans+=1ll+p-res;
            }
        }
        st.insert(p);
        cout<<ans<<"\n";
    }
    return 0;
}