제출 #601608

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
601608		pakhomovee	Global Warming (CEOI18_glo)	C++17	0 / 100	2083 ms	4960 KiB

glo

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

using namespace std;

#define int long long
const int inf = 2e9;

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> mx(n + 1, 0);
    p[0] = -inf;
    for (int i = 0; i < n; ++i) {
        int id = upper_bound(p.begin(), p.end(), a[i]) - p.begin();
        if (p[id - 1] < a[i]) p[id] = a[i];
        mx[i + 1] = max(mx[i], id);
    }
    int ans = 0;
    for (int& i : a) i = -i;
    p.assign(n + 1, inf);
    p[0] = -inf;
    for (int i = n - 1; i >= 0; --i) {
        int id = upper_bound(p.begin(), p.end(), a[i]) - p.begin();
        if (p[id - 1] < a[i]) p[id] = a[i];
        for (int j = i - 1; j >= 0; --j) {
            if (a[i] - a[j] < x) {
                ans = max(ans, mx[j + 1] + id);
            }
        }
    }
    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