제출 #201902

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

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

int n;
vector <pair <int, int> > a;
vector <int> b;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    a.resize(n + 1);
    for(int i = 0 ; i < n + 1 ; i++){
        cin >> a[i].first;
        a[i].second = i;
    }
    b.resize(n);
    for(auto &i : b) cin >> i;
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    vector <int> pref(n), suff(n);
    for(int i = 0 ; i < n ; i++){
        if(i > 0) pref[i] = pref[i - 1];
        pref[i] = max(pref[i], a[i].first - b[i]);
    }
    for(int i = n - 1 ; i >= 0 ; i--){
        if(i < n - 1) suff[i] = suff[i + 1];
        suff[i] = max(suff[i], a[i + 1].first - b[i]);
    }
    vector <int> ans(n + 1);
    for(int i = 0 ; i < n + 1 ; i++){
        ans[a[i].second] = max((i > 0 ? pref[i - 1] : 0), (i < n ? suff[i] : 0));
    }
    for(auto &i : ans) cout << i << " ";
    cout << endl;
}

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