제출 #481708

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481708		Lobo	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	93 ms	10760 KiB

ho_t1

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

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 220000

ii n, ans[maxn], b[maxn], ps[maxn], sf[maxn];
pair<ii,ii> a[maxn];

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    //freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    cin >> n;

    for(ii i = 1; i <= n+1; i++) {
        cin >> a[i].fr;
        a[i].sc = i;
    }

    for(ii i = 1; i <= n; i++)
        cin >> b[i];
    
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
    

    ps[0] = 0;
    for(ii i = 1; i <= n; i++) {
        ps[i] = ps[i-1];
        ps[i] = max(ps[i],a[i].fr-b[i]);
    }

    sf[n+1] = 0;
    for(ii i = n; i >= 1; i--) {
        sf[i] = sf[i+1];
        sf[i] = max(sf[i],a[i+1].fr-b[i]);
    }

    for(ii i = 1; i <= n+1; i++) {
        ans[a[i].sc] = max(ps[i-1],sf[i]);
    }

    for(ii i = 1; i <= n+1; i++) {
        cout << ans[i] << " ";
    }

    cout << endl;

    return 0;
}

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