Submission #201554

#	Time	Username	Problem	Language	Result	Execution time	Memory
201554		kuroni	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	156 ms	7148 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;

const int N = 200005;

int n, a[N], b[N], pr[N], su[N], ans[N];
vector<int> ind;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    for (int i = 1; i <= n + 1; i++) {
        cin >> a[i];
        ind.push_back(i);
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }
    sort(ind.begin(), ind.end(), [](const int &u, const int &v) {
        return a[u] < a[v];
    });
    sort(a + 1, a + n + 2);
    sort(b + 1, b + n + 1);
    for (int i = 1; i <= n; i++) {
        pr[i] = max(pr[i - 1], a[i] - b[i]);
    }
    for (int i = n; i >= 1; i--) {
        su[i] = max(su[i + 1], a[i + 1] - b[i]);
    }
    for (int i = 0; i <= n; i++) {
        ans[ind[i]] = max(pr[i], su[i + 1]);
    }
    for (int i = 1; i <= n + 1; i++) {
        cout << ans[i] << " ";
    }
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91