제출 #1221226

#제출 시각아이디문제언어결과실행 시간메모리
1221226lxphongRabbit Carrot (LMIO19_triusis)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
#define io ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long
using namespace std;

signed main() {
    io;
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    a[0] = 0;

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

    int res = 0;
    for (int i = 1; i <= n; ++i) {
        if (a[i] - a[i - 1] > m) ++res;
    }
    cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...