제출 #1228977

#제출 시각아이디문제언어결과실행 시간메모리
1228977shiovnRabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms328 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pi pair

const long long N=2e5+10;
int a[N];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n,m;
    cin>>n>>m;

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

    a[0]=0;

    int ans=0;

    for(int i=1;i<=n;i++)
    {
        if(a[i-1]+m<a[i])
        {
            a[i]=a[i-1]+m;
            ans++;
        }
    }

    cout<<ans;


}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...