제출 #255077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
255077		Goolakh	Just Long Neckties (JOI20_ho_t1)	C++17	0 / 100	0 ms	384 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math") 
 
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair
 
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
 
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=2e5+10, maxm=1e3+10, lg=21, mod=1e9+7, inf=1e18;

ll n,a[maxn],b[maxn],lm[maxn],rm[maxn];

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.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+1+1), sort(b+1,b+n+1);
	for(int i=1;i<=n+1;i++) lm[i]=max(lm[i-1],a[i]-b[i]);
	for(int i=n+1;i>=2;i--) rm[i]=max(rm[i+1],a[i]-b[i-1]);
	for(int i=1;i<=n+1;i++) cout<<max(lm[i-1],rm[i+1])<<' ';
	
	return 0;
}

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