| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1292524 | thaibeo123 | Just Long Neckties (JOI20_ho_t1) | C++20 | 65 ms | 6884 KiB |
#include <bits/stdc++.h>
using namespace std;
#define NAME "A"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define MASK(x) (1ll << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
const int N = 2e5 + 5;
int n;
int b[N], ans[N], pre[N], suf[N];
pair<int, int> a[N];
void input() {
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 + 2 + n);
sort(b + 1, b + 1 + n);
}
void solve() {
for (int i = 1; i <= n; i++) {
pre[i] = max(pre[i - 1], a[i].fi - b[i]);
}
for (int i = n + 1; i >= 1; i--) {
suf[i] = max(suf[i + 1], a[i].fi - b[i - 1]);
}
for (int i = 1; i <= n + 1; i++) {
ans[a[i].se] = max(pre[i - 1], suf[i + 1]);
}
for (int i = 1; i <= n + 1; i++) {
cout << ans[i] << " ";
}
}
signed main() {
if (fopen(NAME".INP", "r")) {
freopen(NAME".INP", "r", stdin);
freopen(NAME".OUT", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
int t = 1;
//cin >> t;
while (t--) {
input();
solve();
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
