#include int main() { int i, j, k, l, r, N, P[200001], P_inv[200001]; long long A, sum, ans; scanf("%d", &N); for (i = 1; i <= N; i++) { scanf("%d", &(P[i])); P_inv[P[i]] = i; } for (i = 1; i <= N; i++) { scanf("%lld", &A); k = P_inv[i]; ans = 0; for (r = k, sum = 0; r <= N && P[r] >= i; r++) sum += P[r]; r--; for (l = k; l >= 1 && P[l] >= i; sum += P[--l]) { for (; r >= k && sum > A; sum -= P[r--]); if (r >= k) ans += r - k + 1; } printf("%lld\n", ans); } fflush(stdout); return 0; }