제출 #1228994

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

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

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

    int n;
    ll m;
    cin >> n >> m;

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

    ll cur = 0;
    int ans = 0;

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

    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...