import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// root: min (tie-break: left)
class MinCartesianTree {
  int n, rt;
  int[] par, lef, rig;
  void build(T)(T as) {
    n = cast(int)(as.length);
    assert(n >= 1);
    rt = 0;
    par = new int[n]; par[] = -1;
    lef = new int[n]; lef[] = -1;
    rig = new int[n]; rig[] = -1;
    int top = 0;
    auto stack = new int[n];
    foreach (u; 1 .. n) {
      if (as[stack[top]] > as[u]) {  // >
        for (; top >= 1 && as[stack[top - 1]] > as[u]; --top) {}  // >
        if (top == 0) {
          rt = par[lef[u] = stack[top]] = u;
        } else {
          par[lef[u] = stack[top]] = u;
          rig[par[u] = stack[top - 1]] = u;
        }
        stack[top] = u;
      } else {
        rig[par[u] = stack[top]] = u;
        stack[++top] = u;
      }
    }
  }
};


int N;
int[] P;
long[] A;

long[] PSum;
MinCartesianTree ct;
long[] ans;

void dfs(int u, int l, int r) {
  if (!~u) return;
  // [l, u], [u + 1, r]
  const a = A[P[u]];
  long sum;
  if (u - l + 1 <= r - u) {
    auto ran = PSum[u + 1 .. r + 1];
    foreach (i; l .. u + 1) {
      sum += ran.upperBound(PSum[i] + a);
    }
  } else {
    auto ran = PSum[l .. u + 1];
    foreach (i; u + 1 .. r + 1) {
      sum += (u - l + 1) - ran.lowerBound(PSum[i] - a);
    }
  }
  ans[P[u]] = sum;
  dfs(ct.lef[u], l, u);
  dfs(ct.rig[u], u + 1, r);
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      P = new int[N];
      foreach (i; 0 .. N) {
        P[i] = readInt;
      }
      A = new long[N + 1];
      foreach (j; 1 .. N + 1) {
        A[j] = readLong;
      }
      
      PSum = new long[N + 1];
      foreach (i; 0 .. N) {
        PSum[i + 1] = PSum[i] + P[i];
      }
      ct = new MinCartesianTree;
      ct.build(P);
      ans = new long[N + 1];
      dfs(ct.rt, 0, N);
      
      foreach (j; 1 .. N + 1) {
        writeln(ans[j]);
      }
      debug {
        writeln("========");
      }
    }
  } catch (EOFException e) {
  }
}