제출 #1146616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1146616		koukirocks	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	61 ms	6984 KiB

ho_t1

#include<bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0);cin.tie(0)
#define all(x) x.begin(), x.end()
#define F first
#define S second

using namespace std;
typedef pair<int,int> pii;

int main() {
    speed;
    int n;
    cin>>n;
    vector<pii> a(n+1);
    vector<int> b(n);
    for (int i=0;i<=n;i++) {
        cin>>a[i].F;
        a[i].S=i;
    }
    for (int i=0;i<n;i++) {
        cin>>b[i];
    }
    sort(all(a));sort(all(b));
    vector<int> mx(n),mx1(n);
    int now=0;
    for (int i=0;i<n;i++) {
        now=max(now,max(0,a[i].F-b[i]));
        mx[i]=now;
        // cout<<now<<" ";
    }
    // cout<<"mx\n";
    now=0;
    for (int i=n-1;i>=0;i--) {
        now=max(now,max(0,a[i+1].F-b[i]));
        mx1[i]=now;
        // cout<<now<<" ";
    }
    // cout<<"mx\n";
    vector<int> ans(n+1);
    ans[a[0].S]=mx1[0];
    for (int i=1;i<n;i++) {
        ans[a[i].S]=max(mx[i-1],mx1[i]);
    }
    ans[a[n].S]=mx[n-1];
    for (int i=0;i<=n;i++) cout<<ans[i]<<" ";
    return 0;
}

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