제출 #486981

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
486981		jalsol	Global Warming (CEOI18_glo)	C++17	100 / 100	55 ms	3416 KiB

glo

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif

using namespace std;

static const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "empty"
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    return true;
}();

using ll = long long;
using ld = long double;
#define fi first
#define se second

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 2e5 + 5;

int n, x;
int a[maxn];

int dp[maxn];
vector<int> lis, lds;

signed main() {
    cin >> n >> x;
    For (i, 1, n) cin >> a[i];

    For (i, 1, n) {
        int dist;

        if (isz(lis)) {
            dp[i] = lower_bound(all(lis), a[i] + x) - lis.begin();
            dist = lower_bound(all(lis), a[i]) - lis.begin();
        } else {
            dp[i] = 0;
            dist = 0;
        }
 
        if (dist == isz(lis)) {
            lis.push_back(a[i]);
        } else {
            lis[dist] = a[i];
        }
    }
 
    int ans = 0;

    Ford (i, n, 1) {
        int dist;

        if (isz(lds)) {
            dist = lower_bound(all(lds), -a[i]) - lds.begin();
        } else {
            dist = 0;
        }

        if (dist == isz(lds)) {
            lds.push_back(-a[i]);
        } else {
            lds[dist] = -a[i];
        }
 
        chmax(ans, dp[i] + dist + 1);
    }
 
    cout << ans << '\n';
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 13 / 13
• Subtask 4: 10 / 10
• Subtask 5: 20 / 20
• Subtask 6: 17 / 17
• Subtask 7: 25 / 25