Submission #1067807

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067807		BlueGlaucus1	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	164 ms	10916 KiB

ho_t1

#include <iostream>
#include <algorithm>
using namespace std;
int n;
pair<int, int> arr[200005];
int brr[200005];
int suffix[200005];
int prefix[200005];
int answer[200005];
int main(){
    cin >> n;
    for(int i = 1;i<=n+1;i++){
        cin >> arr[i].first;
        arr[i].second = i;
    }
    for(int i = 1;i<=n;i++){
        cin >> brr[i];
    }
    sort(arr+1, arr+n+2);
    sort(brr+1, brr+n+1);
    int maxi =0;
    for(int i = 1; i <= n;i++){
        maxi = max(maxi, arr[i].first-brr[i]);
        prefix[i] = maxi;
    }
    maxi = 0;
    for(int i = n; i >=1;i--){
    maxi = max(maxi, arr[i+1].first-brr[i]);
        suffix[i] = maxi;
    }
    for(int i =1 ; i <=n+1;i++){
        answer[arr[i].second] = max(prefix[i-1], suffix[i]);
    }
    for(int i = 1; i<=n+1;i++){
        cout << answer[i] << " ";
    }
    return 0;
}

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