Submission #670044

#TimeUsernameProblemLanguageResultExecution timeMemory
670044sofija6Just Long Neckties (JOI20_ho_t1)C++14
100 / 100
103 ms15436 KiB
#include <bits/stdc++.h> #define ll long long #define MAXN 200010 using namespace std; ll b[MAXN],pref[MAXN],suff[MAXN],ans[MAXN]; pair<ll,ll> a[MAXN]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n; cin >> n; for (ll i=1;i<=n+1;i++) { cin >> a[i].first; a[i].second=i; } for (ll i=1;i<=n;i++) cin >> b[i]; sort(a+1,a+n+2); sort(b+1,b+1+n); for (ll i=1;i<=n;i++) pref[i]=max(pref[i-1],a[i].first-b[i]); for (ll i=n;i>=1;i--) suff[i]=max(suff[i+1],a[i+1].first-b[i]); for (ll i=1;i<=n+1;i++) ans[a[i].second]=max(pref[i-1],suff[i]); for (ll i=1;i<=n+1;i++) cout << ans[i] << " "; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...