제출 #1214323

#제출 시각아이디문제언어결과실행 시간메모리
1214323rhm_ganGlobal Warming (CEOI18_glo)C++20
100 / 100
38 ms2632 KiB
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif

const int inf = 2e9;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, d;
    cin >> n >> d;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
    	cin >> a[i];
    }

    vector<int> dp(n + 1, inf);
    dp[0] = -inf;

    vector<int> res(n);
    for (int i = n - 1; i >= 0; i--) {
        int p = lower_bound(dp.begin(), dp.end(), -a[i]) - dp.begin();
        res[i] = p;
        dp[p] = -a[i];
    }

    int ans = 0;
    fill(dp.begin(), dp.end(), inf);
    dp[0] = -inf;

    for (int i = 0; i < n; i++) {
        int x = a[i] + d;
        int p = lower_bound(dp.begin(), dp.end(), x) - dp.begin() - 1;
        ans = max(ans, p + res[i]);
        p = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        dp[p] = a[i];
    }

    cout << ans << '\n';

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...