Submission #601649

#	Time	Username	Problem	Language	Result	Execution time	Memory
601649		pakhomovee	Global Warming (CEOI18_glo)	C++17	0 / 100	63 ms	4240 KiB

glo

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>

using namespace std;

const int inf = 1e9 + 10;

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, x;
    cin >> n >> x;
    vector<int> a(n);
    for (int& i : a) {
        cin >> i;
    }
    vector<int> p(n + 1, inf);
    vector<int> dp(n, 0);
    int ans = 0;
    for (int& i : a) i = -i;
    p[0] = -inf;
    vector<int> dpp(n, 0);
    vector<int> query(n);
    for (int i = n - 1; i >= 1; --i) {
        int id = upper_bound(p.begin(), p.end(), a[i]) - p.begin();
        if (p[id - 1] < a[i]) {
            p[id] = a[i];
        } else {
            --id;
        }
        dpp[i] = id;
    }
    p.assign(n + 1, inf);
    p[0] = -inf;
    for (int i = 0; i < n; ++i) {
        int gt = upper_bound(p.begin(), p.end(), a[i] - x + 1) - p.begin();
        int id = upper_bound(p.begin(), p.end(), a[i]) - p.begin();
        if (p[id - 1] < a[i]) {
            p[id] = a[i];
        } else {
            --id;
        }
        ans = max(ans, dpp[i] + gt);
    }
    cout << ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25