#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
#define T P
class segtree{
    vector<T> seg;
    ll N=1;
    T gen=P(inf,-1);
    T f(T a,T b){
        return min(a,b);
    }
public:
    segtree(vector<T> v){
        while(N<v.size())N*=2;
        seg=vector<T>(N*2-1,gen);
        rep(i,v.size())seg[i+N-1]=v[i];
        for(ll i=N-2;i>=0;i--)seg[i]=f(seg[i*2+1],seg[i*2+2]);
    }
    T get(ll a,ll b,ll k=0,ll l=0,ll r=-1){
        if(r==-1)r=N;
        if(a<=l&&r<=b)return seg[k];
        if(r<=a||b<=l)return gen;
        return f(get(a,b,k*2+1,l,(l+r)/2),get(a,b,k*2+2,(l+r)/2,r));
    }
};
int main(){
    ll n;cin>>n;
    vi p(n),v(n);rep(i,n)cin>>p[i];rep(i,n)cin>>v[i];
    vi rui(n+1);
    rep(i,n)rui[i+1]=rui[i]+p[i];
    auto rng=[&](ll l,ll r){
        return rui[r+1]-rui[l];
    };
    vp tmp(n);rep(i,n)tmp[i]=P(p[i],i);
    segtree seg(tmp);
    vi ans(n);
    function<void(ll,ll)> dfs=[&](ll l,ll r){
        if(l>r)return;
        P mi=seg.get(l,r+1);
        if(mi.se-l>r-mi.se){
            for(int j=r;j>=mi.se;j--){
                ll ok=mi.se+1,ng=l-1;
                while(ok-ng>1){
                    ll md=(ok+ng)/2;
                    if(rng(md,j)>v[mi.fi-1])ng=md;
                    else ok=md;
                }
                ans[mi.fi-1]+=mi.se+1-ok;
            }
        }
        else{
            REP(j,l,mi.se+1){
                ll ok=mi.se-1,ng=r+1;
                while(ng-ok>1){
                    ll md=(ok+ng)/2;
                    if(rng(j,md)>v[mi.fi-1])ng=md;
                    else ok=md;
                }
                ans[mi.fi-1]+=ok-mi.se+1;
            }
        }
        dfs(l,mi.se-1);dfs(mi.se+1,r);
    };dfs(0,n-1);
    for(ll x:ans)out(x);
}