Submission #307634

#	Time	Username	Problem	Language	Result	Execution time	Memory
307634		Temmie	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	107 ms	9336 KiB

ho_t1

#include <bits/stdc++.h>

int main() {
	std::ios::sync_with_stdio(0); std::cin.tie(0);
	
	int n; std::cin >> n;
	std::vector <int> b(n), ans(n + 1);
	std::vector <std::pair <int, int>> a(n + 1);
	for (int i = 0; i <= n; i++) std::cin >> a[i].first, a[i].second = i;
	for (int& x : b) std::cin >> x;
	std::sort(a.begin(), a.end());
	std::sort(b.begin(), b.end());
	for (int i = 0, max = 0; i < n; i++) {
		max = std::max(max, a[i].first - b[i]);
		ans[a[i + 1].second] = std::max(ans[a[i + 1].second], max);
	}
	for (int i = n, max = 0; i > 0; i--) {
		max = std::max(max, a[i].first - b[i - 1]);
		ans[a[i - 1].second] = std::max(ans[a[i - 1].second], max);
	}
	for (int i = 0; i <= n; i++) std::cout << ans[i] << " \n"[i == n];
	
}

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