제출 #625250

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

ho_t1

#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>

typedef long long llong;
const int MAXN = 200000 + 10;
const llong INF = 1e18;

int n;
int a[MAXN];
int b[MAXN];
llong prefix[MAXN];
llong suffix[MAXN];

void solve()
{
    std::sort(a + 1, a + 2 + n);
    std::sort(b + 1, b + 1 + n);
    
    for (int i = 1 ; i <= n ; ++i)
    {
        prefix[i] = std::max(prefix[i - 1], 1LL * std::max(0, a[i] - b[i]));
    }

    for (int i = n ; i >= 1 ; --i)
    {
        suffix[i] = std::max(suffix[i + 1], 1LL * std::max(0, a[i+1] - b[i]));
    }

    for (int i = 1 ; i <= n + 1 ; ++i)
    {
        std::cout << std::max(prefix[i - 1], suffix[i]) << ' ';
    }

    std::cout << '\n';
}

void read()
{
    std::cin >> n;
    for (int i = 1 ; i <= n + 1 ; ++i) std::cin >> a[i];
    for (int i = 1 ; i <= n ; ++i) std::cin >> b[i];
}

void fastIO()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIO();
    read();
    solve();

    return 0;
}

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