Submission #1174875

#	Time	Username	Problem	Language	Result	Execution time	Memory
1174875		Hamed_Ghaffari	Just Long Neckties (JOI20_ho_t1)	C++20	0 / 100	0 ms	320 KiB

ho_t1

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

const int MXN = 2e5+5;
int n, a[MXN], b[MXN], dp[MXN];

int32_t main() {
    cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
    cin >> n;
    for(int i=1; i<=n+1; i++) cin >> a[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++) dp[i] = max(dp[i-1], a[i]-b[i]);
    int val=0;
    for(int i=n+1; i>=1; i--) {
        dp[i] = max(dp[i-1], val);
        val = max(val, a[i]-b[i-1]);
    }
    for(int i=1; i<=n+1; i++) cout << dp[i] << ' ';
    cout << '\n';
    return 0;
}

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