제출 #906407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
906407		Le_Minh_Duc	Just Long Neckties (JOI20_ho_t1)	C++14	0 / 100	2 ms	6488 KiB

ho_t1

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

ll n, a[(int)2e5+5], b[(int)2e5+5], c1[(int)2e5+5], c2[(int)2e5+5];

pair <ll, ll> c[(int)2e5+5];

int main(){

	ios_base::sync_with_stdio(0);
	
	cin.tie(0);
	
	cin>>n;
	
	for(int i = 1; i <= n+1; i++) cin>>a[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+1; i++) cout<<a[i]<<" ";
//	
//	cout<<endl;
//	
//	for(int i = 1; i <= n; i++) cout<<b[i]<<" ";
//	
//	cout<<endl;
	
	c1[0] = -1e18; c2[n+1] = -1e18;
	
	for(int i = 1; i <= n; i++){
		
		c[i].f = max(0ll, a[i]-b[i]);
		
		c[i].s = max(0ll, a[i+1]-b[i]);
		
		c1[i] = max(c1[i-1], c[i].f);
	}
	
	for(int i = n; i >= 1; i--){
		
		c2[i] = max(c2[i+1], c[i].s);
	}
	
//	for(int i = 1; i <= n; i++) cout<<c[i].s<<" ";
	
	for(int i = 1; i <= n+1; i++){
		
		cout<<max(c1[i-1], c2[i])<<" ";
	}
}

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