Submission #1361224

#TimeUsernameProblemLanguageResultExecution timeMemory
1361224waygonzJust Long Neckties (JOI20_ho_t1)C++20
100 / 100
51 ms6888 KiB
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    vector<pair<int, int>> a(n+2);
    vector<int> b(n+1), ans(n+2);
    for (int i = 1; i <= n+1; i++) cin >> a[i].first, a[i].second = i;
    for (int i = 1; i <= n; i++) cin >> b[i];
    sort(a.begin() + 1, a.end());
    sort(b.begin() + 1, b.end());
    vector<int> pfx(n+2), sfx(n+2);
    for (int i = 1; i <= n; i++) pfx[i] = max(pfx[i-1], max(0, a[i].first - b[i]));
    pfx[n+1] = pfx[n];
    for (int i = n; i > 0; i--) sfx[i] = max(sfx[i+1], max(0, a[i+1].first - b[i]));
    for (int i = 1; i <= n+1; i++) ans[a[i].second] = max(pfx[i], sfx[i]);
    for (int i = 1; i <= n+1; i++) cout << ans[i] << ' ';
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...