#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,1,-1,0,1,1,-1,-1,0}; const ll dx[9]={1,0,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } struct UnionFind { vector par; vector edge; UnionFind(int n) : par(n, -1),edge(n, 0) {} int root(int x) { if (par[x] < 0) return x; else return par[x] = root(par[x]); } bool same(int x, int y) { return root(x) == root(y); } bool merge(int x, int y) { x = root(x); y = root(y); if (x == y) { edge[x]++; return false; } if (par[x] > par[y]) swap(x, y); par[x] += par[y]; par[y] = x; edge[x] += edge[y]+1; return true; } int size(int x) { return -par[root(x)]; } }; int main(){ ll n;cin >> n; vl x(n),a(n); rep(i,n)cin >> x[i]; rep(i,n)cin >> a[i]; UnionFind uf(n); rep(i,n){ if(binary_search(all(x),x[i]-a[i])){ ll k=lower_bound(all(x),x[i]-a[i])-x.begin(); uf.merge(k,i); } if(binary_search(all(x),x[i]+a[i])){ ll k=lower_bound(all(x),x[i]+a[i])-x.begin(); uf.merge(k,i); } } vl dist(n,-INF); rep(i,n){ ll p=uf.root(i); chmax(dist[p],x[i]+a[i]); } rep(i,n){ ll p=uf.root(i); cout << dist[p]-x[i] << endl; } }