Submission #890471

#	Time	Username	Problem	Language	Result	Execution time	Memory
890471		hafo	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	82 ms	6268 KiB

ho_t1

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 7;
const ll oo = 1e18 + 69;

int n, b[maxn], res[maxn], suf[maxn];
pa a[maxn];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n;
    for(int i = 1; i <= n + 1; i++) {
        cin>>a[i].fi;
        a[i].se = i;
    }
    for(int i = 1; i <= n; i++) cin>>b[i];

    sort(a + 1, a + 1 + n + 1);
    sort(b + 1, b + 1 + n);
    for(int i = n; i >= 1; i--) {
        suf[i] = suf[i + 1];
        maxi(suf[i], max(0, a[i + 1].fi - b[i]));
    }

    res[a[1].se] = suf[1];
    int pre = 0;
    for(int i = 1; i <= n; i++) {
        maxi(pre, max(0, a[i].fi - b[i]));
        res[a[i + 1].se] = max(pre, suf[i + 1]);
    }
    for(int i = 1; i <= n + 1; i++) cout<<res[i]<<" ";
    return 0;
}

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