Submission #636904

#	Time	Username	Problem	Language	Result	Execution time	Memory
636904		tvladm2009	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	225 ms	10860 KiB

ho_t1

#include <iostream>
#include <algorithm>

using namespace std;

const int MAX_N = 2 * 1e5 + 5;
pair<int, int> a[MAX_N + 1];
int b[MAX_N + 1], dp1[MAX_N + 1], dp2[MAX_N + 1], answer[MAX_N + 1];
int n;

int main() {
    cin >> n;
    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 + 1, a + n + 2);
    sort(b + 1, b + n + 1);
    for (int i = 1; i <= n; i++) {
        dp1[i] = max(dp1[i - 1], a[i].first - b[i]);
    }
    for (int i = n + 1; i >= 2; i--) {
        dp2[i] = max(dp2[i + 1], a[i].first - b[i - 1]);
    }
    for (int i = 1; i <= n + 1; i++) {
        answer[a[i].second] = max(dp1[i - 1], dp2[i + 1]);
    }
    for (int i = 1; i <= n + 1; i++) {
        cout << answer[i] << " ";
    }
    return 0;
}

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