Submission #1191958

#	Time	Username	Problem	Language	Result	Execution time	Memory
1191958		callmehuseyn	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	328 KiB

triusis

#include <iostream>
#include <vector>
using namespace std;

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

    vector<int> heights(n);
    for (int i = 0; i < n; ++i)
        cin >> heights[i];

    int count = 0;
    int prev = 0; // Tavşan başlangıçta yerde (yükseklik 0)

    for (int i = 0; i < n; ++i) {
        if (heights[i] - prev > m) {
            // Tavşan bu direğe zıplayamaz
            count++;
        } else {
            // Tavşan bu direğe zıplayabilir, buradan devam eder
            prev = heights[i];
        }
    }

    cout << count << endl;
    return 0;
}

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