Submission #850208

#	Time	Username	Problem	Language	Result	Execution time	Memory
850208		overwatch9	Global Warming (CEOI18_glo)	C++17	62 / 100	81 ms	6244 KiB

glo

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main() {
    int n, x;
    cin >> n >> x;
    vector <ll> nums(n);
    for (int i = 0; i < n; i++)
        cin >> nums[i];
    vector <ll> lis(n), dp;
    vector <ll> lis_val(n);
    for (int i = 0; i < n; i++) {
        auto x = lower_bound(dp.begin(), dp.end(), nums[i]);
        if (x == dp.end())
            dp.push_back(nums[i]);
        else
            *x = nums[i];
        lis_val[i] = dp.back();
        lis[i] = dp.size();
    }
    dp.clear();
    for (int i = 0; i < n; i++) {
        nums[i] = -(nums[i] + x);
        lis_val[i] = -(lis_val[i] + x);
    }
    ll ans = 0;
    for (int i = n-1; i >= 0; i--) {
        auto y = lower_bound(dp.begin(), dp.end(), lis_val[i] + x);
        ans = max(ans, (ll)(y - dp.begin()) + lis[i]);
        auto z = lower_bound(dp.begin(), dp.end(), nums[i]);
        if (z == dp.end()) 
            dp.push_back(nums[i]);
        else
            *z = nums[i];
    }
    cout << ans << '\n';
}

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