제출 #435168

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

ho_t1

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void setIO()
{
    fast;
}
int main()
{
    setIO();
    int n;
    cin>>n;
    vvl a(n + 2,vl(2));
    vl b(n + 1);
    vl out(n + 2);
    vl pref(n + 1),suf(n + 3);
    for (int i = 1;i<=n + 1;i++)cin>>a[i][0],a[i][1] = i;
    for (int i = 1;i<=n;i++)cin>>b[i];
    sort(a.begin() + 1,a.end());
    sort(b.begin() + 1,b.end());
    
    for (int i = 1;i<=n;i++)
        pref[i] = max(pref[i - 1],a[i][0] - b[i]);
    
    for (int i = n;i>=1;i--)
        suf[i] = max(suf[i + 1],a[i + 1][0] - b[i]);
    for (int i = 1;i<=n + 1;i++){
        int pos = a[i][1];
        ll cur = max(pref[i - 1],suf[i]);
        out[pos] = cur;
    }
    for (int i = 1;i<=n + 1;i++)cout<<out[i]<<" ";
    return 0;
}

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