Submission #1213910

#TimeUsernameProblemLanguageResultExecution timeMemory
1213910semiautoGlobal Warming (CEOI18_glo)C++20
100 / 100
71 ms2500 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n, d;
    cin >> n >> d;
    int a[n], p[n];
    vector <int> lis;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        int ind = lower_bound(lis.begin(), lis.end(), a[i]) - lis.begin();
        if (ind == (int)lis.size()) {
            lis.push_back(a[i]);
        } else {
            lis[ind] = a[i];
        }
        p[i] = ind + 1;
    }
    int ans = lis.size();
    lis.clear();
    for (int i = n - 1; i >= 0; i--) {
        int ind = lower_bound(lis.begin(), lis.end(), -a[i]) - lis.begin();
        if (ind == (int)lis.size()) {
            lis.push_back(-a[i]);
        } else {
            lis[ind] = -a[i];
        }
        if (i == 0) {
            continue;
        }
        // p[i - 1]
        int k = lower_bound(lis.begin(), lis.end(), d - a[i - 1]) - lis.begin();
        ans = max(ans, k + p[i - 1]);
    }
    cout << ans << endl;
    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...