제출 #206692

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

ho_t1

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;

const int maxn = 4e5 + 10;

pair<int,int> a[maxn];
int b[maxn], pre[maxn], suf[maxn], ans[maxn];

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	for (int i = 1; i <= n+1; i++){
		cin >> a[i].first;
		a[i].second = 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++)
		pre[i] = max(pre[i - 1], a[i].first - b[i]);
	for (int i = n + 1; i >= 2; i--)
		suf[i] = max(suf[i + 1], a[i].first - b[i - 1]);
	for (int i = 1; i <= n+1; i++)
		ans[a[i].second] = max(pre[i - 1], suf[i + 1]);
	for (int i = 1; i <= n + 1; i++)
		cout << ans[i] << " \n"[i==n+1];
}

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