Submission #635729

#	Time	Username	Problem	Language	Result	Execution time	Memory
635729		zsombor	Global Warming (CEOI18_glo)	C++17	100 / 100	114 ms	4572 KiB

glo

#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;
}

• 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