Submission #702547

#	Time	Username	Problem	Language	Result	Execution time	Memory
702547		guagua0407	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	225 ms	10744 KiB

ho_t1

#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second


const int mxn=2e5+5;

pair<int,int> a[mxn];
int b[mxn];
int l[mxn];
int r[mxn];
int ans[mxn];

int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n+1;i++){
        cin>>a[i].f;
        a[i].s=i;
    }
    for(int i=1;i<=n;i++){
        cin>>b[i];
    }
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
    for(int i=1;i<=n;i++){
        l[i]=max(a[i].f-b[i],0);
        r[i]=max(a[i+1].f-b[i],0);
    }
    for(int i=n;i>=1;i--){
        l[i]=max(l[i+1],l[i]);
        r[i]=max(r[i+1],r[i]);
    }
    int mxl=0;
    for(int i=1;i<=n+1;i++){
        ans[a[i].s]=max(mxl,r[i]);
        if(i<=n) mxl=max(mxl,l[i]);
    }
    for(int i=1;i<=n+1;i++){
        cout<<ans[i]<<' ';
    }
}

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