제출 #635729

#제출 시각아이디문제언어결과실행 시간메모리
635729zsomborGlobal Warming (CEOI18_glo)C++17
100 / 100
114 ms4572 KiB
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
    int n, x, hely, cur, ans = 0;
    cin >> n >> x;
    vector <int> v(n);
    for (int i = 0; i < n; i++) cin >> v[i];

    vector <int> suf(n);
    vector <int> dp(n + 1);

    fill(dp.begin(), dp.end(), 2e9);
    dp[0] = -2e9;
    for (int i = n - 1; i >= 0; i--) {
        hely = lower_bound(dp.begin(), dp.end(), -v[i]) - dp.begin();
        suf[i] = hely;
        dp[hely] = -v[i];
    }

    fill(dp.begin(), dp.end(), 2e9);
    dp[0] = -2e9;
    for (int i = 0; i < n; i++) {
        cur = lower_bound(dp.begin(), dp.end(), v[i] + x) - dp.begin() - 1 + suf[i];
        ans = max(ans, cur);
        hely = lower_bound(dp.begin(), dp.end(), v[i]) - dp.begin();
        suf[i] = hely;
        dp[hely] = v[i];
    }
    cout << ans;
}
#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...