Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long
- #define _test int _TEST; cin>>_TEST; while(_TEST--)
- int main()
- {
- _test
- {
- int n;
- cin>>n;
- vector<ll int> a(n);
- vector<ll int> b(n);
- for(auto &e: a) cin>>e;
- for(auto &e: b) cin>>e;
- vector<ll int> pref(n);
- vector<ll int> suff(n);
- for(int i=0; i<n; i++)
- {
- pref[i] = b[i] - a[i];
- if(i > 0) pref[i] += max(0ll, pref[i-1] - b[i]);
- }
- for(int i=n-1; i>=0; i--)
- {
- suff[i] = b[i] - a[i];
- if(i < n-1) suff[i] += max(0ll, suff[i+1] - b[i]);
- }
- for(int i=0; i<n; i++)
- {
- ll int p=0, s=0;
- if(i > 0) p = pref[i-1];
- if(i < n-1) s = suff[i+1];
- cout<<max(b[i]-a[i], p + s - a[i])<<" ";
- }
- cout<<"\n";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement