제출 #702473

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702473		1075508020060209tc	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	432 ms	23684 KiB

ho_t1

//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;
int orgar[500005];
int ar[500005];
int br[500005];
int psans[500005];
int sfans[500005];
signed main(){
cin>>n;
for(int i=1;i<=n+1;i++){
    cin>>orgar[i];
    ar[i]=orgar[i];
}
for(int i=1;i<=n;i++){
    cin>>br[i];
}
sort(ar+1,ar+n+1+1);
sort(br+1,br+n+1);
for(int i=1;i<=n;i++){
    psans[i]=max(psans[i-1],ar[i]-br[i]);
}
for(int i=n+1;i>=2;i--){
    sfans[i]=max(sfans[i+1],ar[i]-br[i-1]);
}
map<int,int>mp;
for(int i=1;i<=n+1;i++){
    mp[ar[i]]=max(psans[i-1],sfans[i+1]);
}
for(int i=1;i<=n+1;i++){
    cout<<mp[orgar[i]]<<" ";
}


}

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