Submission #1243453

#	Time	Username	Problem	Language	Result	Execution time	Memory
1243453		fauntleroy	Global Warming (CEOI18_glo)	C++20	100 / 100	44 ms	8264 KiB

glo

#include <iostream>
#include <cstdio>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <limits>
#include <tuple>
#include <stack>
#include <bitset>
#include <cstring>
#include <sstream>
#include <functional>
#include <random>
#define int long long
using namespace std;

void solve() {
    int n, x;
    cin >> n >> x;
    vector<int> a(n);
    for (auto& e : a)
        cin >> e;;
    vector<int> b(n, 1e9), c(n);
    vector<int> l(n), r(n);
    for (int i = 0; i < n; ++i) {
        int id = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
        b[id] = a[i];
        l[i] = id + 1;
    }
    fill(b.begin(), b.end(), 1e9);
    for (int i = 0; i < n; ++i)
        c[i] = a[n - i - 1];

    for (int i = 0; i < n; ++i) {
        int id1 = lower_bound(b.begin(), b.end(), -c[i] + x) - b.begin();
        r[n - i - 1] = id1 + 1;
        int id2 = lower_bound(b.begin(), b.end(), -c[i]) - b.begin();
        b[id2] = -c[i];
    }
    int ans = 0;
    for (int i = 0; i < n; ++i)
        ans = max(ans, l[i] + r[i] - 1);
    cout << ans << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    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