import sys input = lambda : sys.stdin.readline().rstrip() sys.setrecursionlimit(2*10**5+10) write = lambda x: sys.stdout.write(x+"\n") debug = lambda x: sys.stderr.write(x+"\n") class BIT: ### BIT binary def __init__(self, n, values=None): self.bit = [0]*(n+1) self.n = n self.total = 0 if values is not None: for i,v in enumerate(values): self.add(i,v) self.total += v def check(self): l = [] prv = 0 for i in range(1,self.n+1): val = self.query(i) l.append(val-prv) prv = val print(" ".join(map(str, l))) #a1 ~ aiまでの和 O(logn) def query(self,i): res = 0 while i > 0: res += self.bit[i] # res %= M i -= i&(-i) return res def get(self,i): return self.query(i+1) - self.query(i) #ai += x(logN) def add(self,i,x): i += 1 if i==0: raise RuntimeError self.total += x while i <= self.n: self.bit[i] += x # self.bit[i] %= M i += i&(-i) def index(self, v): """a0,...,aiの和がv以上になる最小のindexを求める 存在しないとき配列サイズを返す """ if v <= 0: return 0 if self.total0: if x+ll>1 return x n = int(input()) p = list(map(lambda i: int(i), input().split())) A = list(map(int, input().split())) cum = [0] for v in p: cum.append(cum[-1]+v) index = [-1]*(n+1) for i,v in enumerate(p): index[v] = i bit = BIT(n) ans = [] for i in range(1,n+1): a = A[i-1] ind = index[i] if a==0: bit.add(ind, 1) ans.append(0) continue v = bit.query(ind) l = bit.index(v) if v==0: l = -1 r = bit.index(v+1) # print(i,ind,l,r,a) j = ind+1 val = 0 for ii in range(l+1, ind+1): while j+1<=r and cum[j+1]-cum[ii]<=a: j += 1 if cum[j]-cum[ii]<=a: val += (j-ind) bit.add(ind, 1) ans.append(val) write("\n".join(map(str, ans)))