제출 #1280380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280380		bananade	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	72 ms	16844 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define int long long
int jaw[300005], arr[300005], ARR[300005], n, m, pref[300005], suff[300005];
vector<pair<int, int>> v;
vector<int> x;

signed main() {
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n + 1; i++) {
		cin >> arr[i];
		v.push_back({arr[i], i});
	}
	sort(v.begin(), v.end());
	for(int i = 1; i <= n; i++) {
		cin >> ARR[i];
		x.push_back(ARR[i]);
	}
	sort(x.begin(), x.end());
	for(int i = 0; i < x.size(); i++) {
		pref[i + 1] = max(pref[i], v[i].first - x[i]);
	}
	for(int i = v.size() - 1; i >= 1; i--) {
		suff[i + 1] = max(suff[i + 2], v[i].first - x[i - 1]);
	}
	for(int i = 0; i < v.size(); i++) {
		//int jaw = pref[i];
		int brp = v.size() - 1 - i;
		jaw[v[i].second] = max(pref[i], suff[i + 2]);
		
		//cout << max(pref[i], suff[i + 1]) << " ";
	}
	for(int i = 1; i <= n + 1; i++) {
		cout << jaw[i] << " ";
	}
	cout << "\n";
}

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