Submission #805659

#TimeUsernameProblemLanguageResultExecution timeMemory
805659AmrTRabbit Carrot (LMIO19_triusis)C++17
0 / 100
0 ms212 KiB
#include <bits/stdc++.h>
#define lop(i,a,b) for(ll i = a; i < b; i++)
#define ll long long
using namespace std;
ll mod = 1e9 + 7;

signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;
    ll arr[n + 1] = {}, ans = 0; 
    lop(i, 0, n) cin >> arr[i + 1];

    for(int i = 0; i < n; i++){
        if(arr[i] + k < arr[i + 1]) ans++, arr[i + 1] = arr[i] + k;
    }

    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...