Submission #1224766

#TimeUsernameProblemLanguageResultExecution timeMemory
1224766LM1Just Long Neckties (JOI20_ho_t1)C++20
100 / 100
60 ms6980 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define fr(i,ii,iii) for(int i=ii;i<iii;i++)
const int N=2e5+5;
int n,b[N],pr[N],sf[N],ans[N];
pii a[N];
int main(){
	ios_base::sync_with_stdio(NULL);cin.tie(NULL);
	cin>>n;
	fr(i,1,n+2){
		cin>>a[i].ff;
		a[i].ss=i;
	}
	fr(i,1,n+1)cin>>b[i];
	sort(a+1,a+n+2);
	sort(b+1,b+n+1);
	fr(i,1,n+1)pr[i]=max(pr[i-1],max(a[i].ff-b[i],0));
	for(int i=n;i>=1;i--)sf[i]=max(sf[i+1],max(a[i+1].ff-b[i],0));
	fr(i,1,n+2){
		ans[a[i].ss]=max(pr[i-1],sf[i]);
	}
	fr(i,1,n+2)cout<<ans[i]<<" ";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...