제출 #969170

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

ho_t1

#include <iostream>
#include <algorithm>
#define f first
#define s second
using namespace std;

long long n, b[200010], maxx[200010], maxxx, ans[200010];
pair<long long,int> a[200010];

int main() {
	cin >> n;
	for (int i = 1; i <= n+1; i++) {
		cin >> a[i].f;
		a[i].s = 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 = n; i >= 1; i--) maxx[i] = max(maxx[i+1],a[i+1].f-b[i]);
	for (int i = 1; i <= n+1; i++) {
		ans[a[i].s] = max(maxxx,maxx[i]);
		maxxx = max(maxxx,a[i].f-b[i]);
	}
	for (int i = 1; i <= n+1; i++) cout << ans[i] << " ";
	cout << endl;
}

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