제출 #1229049

#제출 시각아이디문제언어결과실행 시간메모리
1229049buixuiaRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms328 KiB
#include<bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long n, m, h[N];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n>>m;
    h[0] = 0;
    for(long long i = 1; i <= n; ++i) cin>>h[i];
    long long res = 0,cur = 0;
    for(long long i = 1; i <= n; ++i){
        if(h[i] <= cur + m)cur = h[i];
        else{
            ++res;
            cur = cur + m;
        }
    }
    cout<<res<<'\n';
    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...