Submission #1341816

#TimeUsernameProblemLanguageResultExecution timeMemory
1341816cansu_mutluJust Long Neckties (JOI20_ho_t1)C++20
100 / 100
66 ms8676 KiB
#include<bits/stdc++.h>
#define int long long 
using namespace std;
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<array<int,2>> a(n+1);
    for(int i=0;i<=n;i++)
    {
        cin >> a[i][0];
        a[i][1] = i;
    }
    sort(a.begin(),a.end());
    vector<int> b(n);
    for(int i=0;i<n;i++) cin >> b[i];
    sort(b.begin(),b.end());
    int ans = 0;
    for(int i=0;i<n;i++)
    {
        ans = max(ans,a[i][0]-b[i]);
    }
    vector<int> son(n+1);
    son[a[n][1]] = ans;
    for(int i=n-1;i>=0;i--)
    {
        ans = max(ans,a[i+1][0]-b[i]);
        son[a[i][1]] = ans;
    }
    for(int i=0;i<=n;i++) cout << son[i] << " ";
    cout << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...