Submission #829494

#	Time	Username	Problem	Language	Result	Execution time	Memory
829494		Github	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	1 ms	212 KiB

triusis

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <iterator>
#include <deque>
#include <cmath>
#include <cstring>
#include <climits>
#include <algorithm>

using namespace std;
typedef long long ll;

ll minLIS(vector<ll> &a, ll st){
    multiset<ll> s;
    s.insert(0);
    ll ans = 1;
    auto cur = s.begin();
    for (ll u: a){
        auto it = s.lower_bound(u-st);
        if (it != s.end()){
            bool flag = false;
            if (it == cur){
                ans++;
                flag = true;
            }
            s.erase(it);
            s.insert(u);
            if (flag) {
                cur = s.find(u);
            }
        }else{
            s.insert(u);
        }
    }
    return ans;
}

int main() {
    ll n, m; cin >> n >> m;
    vector<ll> a(n);
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    cout << n+1-minLIS(a, m) << endl;
    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37