제출 #1083970

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1083970		ZeroCool	Just Long Neckties (JOI20_ho_t1)	C++14	0 / 100	1 ms	6748 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ar array

const int LOG = 20;
const int MOD = 1e9 + 7;
const int INF = 1e18;

const int N = 3e5 + 20;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,avx,bmi,bmi2")

int a[N], A[N], B[N], pref[N], suff[N];
int n;


signed main(){ios_base::sync_with_stdio(false);
    cin>>n;
    for(int i = 1;i <= n + 1;i++)cin>>a[i], A[i] = a[i];
    for(int i = 1;i <= n;i++)cin>>B[i];
    sort(A + 1, A + n + 2);
    sort(B + 1, B + n + 1);
    //assert(0);
    for(int i = 1;i <= n;i++)pref[i] = max(pref[i - 1], A[i] - B[i]);
    for(int i = n;i > 1;i--)suff[i] = max(suff[i + 1], A[i] - B[i - 1]);
    map<int,int> ans;
    for(int i =1;i <= n + 1;i++)ans[A[i]] = max(pref[i - 1], suff[i + 1]);
    for(int i = 1 ;i <= n + 1;i++)cout<<ans[a[i]]<<" ";
}

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