제출 #141208

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
141208		meatrow	Global Warming (CEOI18_glo)	C++17	100 / 100	78 ms	5496 KiB

glo

//#pragma GCC optimize("O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, x;
    cin >> n >> x;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        b[n - i - 1] = -a[i];
    }
    vector<int> t(n + 1, INT32_MAX);
    t[0] = INT32_MIN;
    vector<int> lds(n);
    for (int i = 0; i < n; ++i) {
        lds[i] = lower_bound(t.begin(), t.end(), b[i]) - t.begin();
        t[lds[i]] = min(t[lds[i]], b[i]);
    }
    t.assign(n + 1, INT32_MAX);
    t[0] = INT32_MIN;
    int ans = 1;
    for (int i = 0; i + 1 < n; ++i) {
        int kek = lower_bound(t.begin(), t.end(), a[i]) - t.begin();
        t[kek] = min(t[kek], a[i]);
        ans = max(ans, kek);
        int pos = lower_bound(t.begin(), t.end(), a[i + 1] + x) - t.begin() - 1;
        ans = max(ans, pos + lds[n - i - 2]);
    }
    cout << ans;
    return 0;
}

• 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