Submission #656874

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

triusis

// LIS - triusis
#include <iostream>
#include <vector>
using namespace std;

const int N = 2e5 + 10;
int a[N];

int main() {
    int n, d;
    cin >> n >> d;

    for(int i = 1; i <= n; i++)
    cin >> a[i];

    vector<int> st, id;
    st.push_back(0);
    id.push_back(0);

    for(int i = 1; i <= n; i++) {
        if(st[st.size() - 1] >= a[i]) {
            st.push_back(a[i]);
            id.push_back(i);
            continue;
        }

        int da = a[i] - st[st.size() - 1];
        int di = i - id[id.size() - 1];

        if(di * d >= da) {
            st.push_back(a[i]);
            id.push_back(i);
        }
    }

    cout << n - (st.size() - 1) << '\n';
    return 0;
}

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