제출 #318014

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
318014		nandonathaniel	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	110 ms	11096 KiB

ho_t1

#include<bits/stdc++.h>
using namespace std;
const int MAXN=200005;
typedef pair<int,int> pii;
int b[MAXN],pref[MAXN],suf[MAXN],ans[MAXN];
vector<pii> v;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n,a;
	cin >> n;
	for(int i=1;i<=n+1;i++){
		cin >> a;
		v.push_back({a,i});
	}
	for(int i=1;i<=n;i++)cin >> b[i];
	sort(v.begin(),v.end());
	sort(b+1,b+n+1);
	for(int i=1;i<=n;i++){
		pref[i]=max(pref[i-1],max(v[i-1].first-b[i],0));
	}
	for(int i=n;i>=1;i--){
		suf[i]=max(suf[i+1],max(v[i].first-b[i],0));
	}
	for(int i=0;i<=n;i++){
		ans[v[i].second]=max(pref[i],suf[i+1]);
	}
	for(int i=1;i<=n;i++)cout << ans[i] << " ";
	cout << ans[n+1] << '\n';
	return 0;
}

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