Submission #1369579

#TimeUsernameProblemLanguageResultExecution timeMemory
1369579blueyesGlobal Warming (CEOI18_glo)C++20
100 / 100
37 ms3560 KiB
#include <bits/stdc++.h>

using namespace std;

void solve() 
{
    int n, x;
    cin >> n >> x;

    vector<int> a(n), len(n), dp(n, int(1e10 + 10));
    int mx = 0;

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

        int j = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();

        len[i] = j + 1;
        dp[j] = a[i];
        mx = max(mx, len[i]);
    }

    dp = vector<int> (n, int(1e10 + 10));

    for (int i = n - 1; i >= 0; i--) {
        int pos = lower_bound(dp.begin(), dp.end(), -a[i] + x) - dp.begin();
        mx = max(mx, len[i] + pos);

        int j = lower_bound(dp.begin(), dp.end(), -a[i]) - dp.begin();
        dp[j] = -a[i];
    }

    cout << mx << '\n';
}

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

    int t = 1;
    //cin >> t;

    while (t--) {
        solve();
    }

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