This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = 2e5 + 5;
pair <int, int> a[N];
int ans[N];
int b[N];
int f[N];
int g[N];
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i].fi, a[i].se = i;
for (int i = 1; i <= n; i++)
cin >> b[i];
sort(a + 1, a + n + 1 + 1);
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; i++)
f[i] = max(f[i - 1], a[i].fi - b[i]);
for (int i = n + 1; i >= 1; i--)
g[i] = max(g[i + 1], a[i].fi - b[i - 1]);
for (int i = 1; i <= n + 1; i++)
ans[a[i].se] = max({0, f[i - 1], g[i + 1]});
for (int i = 1; i <= n + 1; i++)
cout << ans[i] << " ";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |