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 pii pair<int, int>
using namespace std;
int N;
pii neck[200005];
int A[200005];
int bacc[200005];
int fron[200005];
int ans[200005];
int main() {
ios_base::sync_with_stdio(0);
cin >> N;
for(int i = 1; i <= N + 1; i++) {
cin >> neck[i].first;
neck[i].second = i;
}
for(int i = 1; i <= N; i++) {
cin >> A[i];
}
sort(neck + 1, neck + N + 2);
sort(A + 1, A + N + 1);
for(int i = 1; i <= N; i++) {
int now = neck[i + 1].second;
ans[now] = max(neck[i].first - A[i], 0);
ans[now] = max(ans[neck[i].second], ans[now]);
}
int bef = 0;
for(int i = N; i > 0; i--) {
int now = neck[i].second;
bef = max(neck[i + 1].first - A[i], bef);
ans[now] = max(ans[now], bef);
}
for(int i = 1; i <= N + 1; i++) {
cout << ans[i] << " ";
}
cin >> N;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |