#include<bits/stdc++.h>
using namespace std;
void PlayGround() {
int n;
cin>>n;
vector<pair<int,int>>a(n+1);
for(int i=0; i<n+1; i++) {
cin>>a[i].first;
a[i].second = i;
}
sort(a.begin(), a.end());
int b[n];
for(int i=0; i<n; ++i) {
cin>>b[i];
}
sort(b, b+n);
int ans[n+1] = {0};
int pre[n+1] = {0}, suf[n+1] = {0};
for(int i=0; i<n; ++i) {
int strangeness = max(0, a[i+1].first-b[i]);
pre[i] = max(pre[i], strangeness);
strangeness = max(0, a[i].first-b[i]);
suf[i+1] = max(suf[i+1], strangeness);
}
for(int i=n; i>-1; --i) {
if(i<n) pre[i] = max(pre[i+1], pre[i]);
ans[a[i].second] = max(ans[a[i].second], pre[i]);
}
for(int i=0; i<=n; ++i) {
if(i) suf[i] = max(suf[i], suf[i-1]);
ans[a[i].second] = max(ans[a[i].second], suf[i]);
}
for(int i=0; i<n+1; ++i) {
cout<<ans[i]<<' ';
}
cout<<'\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
PlayGround();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
340 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
340 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
1 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
1 ms |
340 KB |
Output is correct |
31 |
Correct |
1 ms |
340 KB |
Output is correct |
32 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
340 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
340 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
1 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
1 ms |
340 KB |
Output is correct |
31 |
Correct |
1 ms |
340 KB |
Output is correct |
32 |
Correct |
1 ms |
340 KB |
Output is correct |
33 |
Correct |
79 ms |
6252 KB |
Output is correct |
34 |
Correct |
83 ms |
6480 KB |
Output is correct |
35 |
Correct |
79 ms |
6352 KB |
Output is correct |
36 |
Correct |
79 ms |
6732 KB |
Output is correct |
37 |
Correct |
83 ms |
6880 KB |
Output is correct |
38 |
Correct |
101 ms |
6848 KB |
Output is correct |
39 |
Correct |
99 ms |
5896 KB |
Output is correct |
40 |
Correct |
81 ms |
5916 KB |
Output is correct |
41 |
Correct |
82 ms |
6068 KB |
Output is correct |
42 |
Correct |
82 ms |
5932 KB |
Output is correct |
43 |
Correct |
81 ms |
5936 KB |
Output is correct |
44 |
Correct |
80 ms |
5652 KB |
Output is correct |
45 |
Correct |
78 ms |
5668 KB |
Output is correct |
46 |
Correct |
77 ms |
5652 KB |
Output is correct |
47 |
Correct |
75 ms |
5452 KB |
Output is correct |
48 |
Correct |
77 ms |
5472 KB |
Output is correct |
49 |
Correct |
81 ms |
6140 KB |
Output is correct |
50 |
Correct |
87 ms |
6116 KB |
Output is correct |
51 |
Correct |
86 ms |
6116 KB |
Output is correct |
52 |
Correct |
84 ms |
6112 KB |
Output is correct |
53 |
Correct |
81 ms |
6104 KB |
Output is correct |