제출 #486265

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

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n;
	cin >> n;
	vector<pair<ll,int>> v;
	for(int i = 0; i < n + 1; i++){
		ll x;
		cin >> x;
		v.pb(mp(x,i));
	}
	ll ans[n + 1];
	sv(v);
	ll arr[n];
	for(int i = 0; i < n; i++)cin >> arr[i];
	sa(arr,n);
	ll mx = 0;
	for(int i = 0; i < n; i++)mx = max(mx, v[i].vf - arr[i]);
	ans[v[n].vs] = mx;
	for(int i = n-1; i >= 0; i--){
		mx = max(mx , v[i + 1].vf - arr[i]);
		ans[v[i].vs] = mx;
	}
	for(int i = 0; i < n + 1; i++)cout << ans[i] << ' ';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

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