제출 #211444

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
211444		brcode	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	303 ms	15484 KiB

ho_t1

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5+5;
pair<long long,long long> a[MAXN];
long long b[MAXN];
long long pref[MAXN];
long long suff[MAXN];
long long ans[MAXN];
int main(){
    long long n;
    cin>>n;
    for(long long i=1;i<=n+1;i++){
        cin>>a[i].first;
        a[i].second = i;
    }
    for(long long i=1;i<=n;i++){
        cin>>b[i];
        
    }
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
    for(long long i=1;i<=n;i++){
        pref[i] = max(max((long long)0,a[i].first-b[i]),pref[i-1]);
        
    }
    for(long long i=n;i>=1;i--){
        suff[i] = max(max((long long)0,a[i+1].first-b[i]),suff[i+1]);
      // cout<<a[i+1].first<<endl;
      //  cout<<b[i]-a[i+1].first<<endl;
    }
    for(long long i=1;i<=n+1;i++){
        ans[a[i].second] = max(pref[i-1],suff[i]);
    }
    for(long long i=1;i<=n+1;i++){
        cout<<ans[i]<<" ";
    }
    
}

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