제출 #624824

#제출 시각아이디문제언어결과실행 시간메모리
624824paulicaRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define fr first
#define sec second
#define mp make_pair
 
ll t,n,m;
ll L[17];
 
int main(){
    cin >> n >> m;
    ll cur=0,br=0;
    for(int i=0;i<n;i++){
        ll x; cin >> x;
        if(x<=cur+m){cur=x; continue;}
        br++; cur=cur+m;
    }
    cout<<br;
    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...