Submission #1269556

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269556		lucasmin2011	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	36 ms	448 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M;
    cin >> N >> M;
    vector<long long> a(N+1);
    for (int i = 1; i <= N; i++) cin >> a[i];

    vector<int> dp(N+1, 0);
    int best = 0;

    for (int i = 1; i <= N; i++) {
        // try starting from ground (0)
        if (a[i] <= M) dp[i] = 1;

        for (int j = 1; j < i; j++) {
            if (a[i] <= a[j] + M && dp[j] > 0) {
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
        best = max(best, dp[i]);
    }

    cout << N - best << "\n";
    return 0;
}

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