제출 #871134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
871134		Marco_Escandon	Just Long Neckties (JOI20_ho_t1)	C++11	100 / 100	185 ms	16064 KiB

ho_t1

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ll n;
    cin>>n;
    pair<ll,ll> cad[n+1];ll cad2[n];
    for(int i=0; i<n+1; i++)
    {
        cin>>cad[i].first;
        cad[i].second=i;
    }
    for(int j=0; j<n; j++)
        cin>>cad2[j];
    sort(cad,cad+n+1);
    sort(cad2,cad2+n);
    ll ac[n+4]={ };
    for(int i=n; i>0; i--)
    {
        ac[i]=max(0LL,cad[i].first-cad2[i-1]);
        ac[i]=max(ac[i+1],ac[i]);
    }
    ll act=0;
    vector<pair<ll,ll>> sol;
    sol.push_back({cad[0].second,ac[1]});
    for(int i=0; i<n; i++)
    {
        act=max(act,cad[i].first-cad2[i]);
        sol.push_back({cad[i+1].second,max(ac[i+2],act)});
    }
    sort(sol.begin(),sol.end());
    for(auto i:sol)
        cout<<i.second<<" ";
}

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