제출 #1163738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1163738		canhnam357	Art Exhibition (JOI18_art)	C++20	100 / 100	167 ms	16464 KiB

art

#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define int long long 

// https://cses.fi/problemset/task/1649/
// 1-indexed
template<typename T, typename F>
struct segtree {
    const size_t sz; const T ID; F f{};
    vector<T> tree;
    segtree(size_t n, T ID) : segtree(n, ID, F{}) {}
    explicit segtree(size_t n, T ID, const F& f) :
        sz(Log2(n)), ID(ID), f(f),
        tree(sz << 1, ID) {}
    static size_t Log2(size_t n) {
        n--;
        for (int i = 0; i < 5; i++) n |= n >> (1 << i);
        return n + 1;
    }
    void update(int i, T val) {
        --i |= sz; tree[i] = val;
        while (i >>= 1) tree[i] = f(tree[i << 1], tree[i << 1 | 1]);
    }
    T query(int l, int r) const {
        T L = ID, R = ID; --l |= sz, --r |= sz;
        while (l <= r) {
            if (l & 1) L = f(L, tree[l++]);
            if (~r & 1) R = f(tree[r--], R);
            l >>= 1, r >>= 1;
        }
        return f(L, R);
    }
};
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pair<int, int>> v(n);
    for (auto &[fi, se] : v) cin >> fi >> se;
    sort(all(v));
    auto f = [&](int a, int b) -> int { return a > b ? a : b; };
    segtree<int, decltype(f)> tree(n + 5, numeric_limits<int>::min(), f);
    int sum = 0, ans = LLONG_MIN;
    for (int i = 0; i < n; i++)
    {
        auto [fi, se] = v[i];
        tree.update(i + 1, fi - sum);
        sum += se;
        ans = max(ans, sum - fi + tree.query(1, i + 1));
    }
    cout << ans;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50