Submission #1151984

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151984		trufanov.p	Global Warming (CEOI18_glo)	C++20	100 / 100	40 ms	2764 KiB

glo

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <string>
#include <queue>
#include <unordered_set>
#include <deque>

using namespace std;

const int INF = 2e9 + 7;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, x;
    cin >> n >> x;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<int> suff(n);
    vector<int> dp(n + 1, INF);
    dp[0] = -INF;
    for (int i = n - 1; i > -1; --i) {
        int pos = lower_bound(dp.begin(), dp.end(), -a[i]) - dp.begin();
        suff[i] = pos;
        dp[pos] = -a[i];
    }
    int ans = 0;
    dp.assign(n + 1, INF);
    dp[0] = -INF;
    dp[1] = a[0];
    for (int i = 1; i < n; ++i) {
        int preflen = lower_bound(dp.begin(), dp.end(), a[i] + x) - dp.begin();
        ans = max(ans, preflen + suff[i] - 1);
        dp[lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin()] = a[i];
    }
    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