제출 #470546

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
470546		vincent97198	Just Long Neckties (JOI20_ho_t1)	C++14	1 / 100	2 ms	576 KiB

ho_t1

#include <bits/stdc++.h>
#define int long long

using namespace std;

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);   cout.tie(nullptr);
    
    int n;  cin >> n;
    vector<pair<int,int>> a(n+2),b(n+1);
    for(int i=1;i<=n+1;++i)    cin >> a[i].first;
    for(int i=1;i<=n;++i)    cin >> b[i].first;
    
    for(int i=1;i<=n+1;++i)   a[i].second=i;
    
    sort(a.begin()+1,a.end());
    sort(b.begin()+1,b.end());
    
    vector<int> Lans(n+5,-1e18),Rans(n+5,-1e18);
    for(int i=1;i<=n;++i){
        Lans[i]=max(Lans[i-1],max(0LL,a[i].first-b[i].first));
        // cout << "Lans" << Lans[i] << '\n';
    }
    for(int i=n+1;i>=2;--i){
        Rans[i]=max(Rans[i+1],max(0LL,a[i].first-b[i-1].first));
        // cout << "Rans" << Rans[i] << '\n';
    }
    
    vector<int> ans(n+1);
    for(int i=1;i<=n+1;++i){
        ans[a[i].second]=max(Lans[i-1],Rans[i+1]);
        // cout << "a[i].second" << a[i].second << '\n';
    }
    
    for(int i=1;i<=n+1;++i)
        cout << ans[i] << '\n';
    
    return 0;
}

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