제출 #540507

#제출 시각아이디문제언어결과실행 시간메모리
540507juankipediaRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms348 KiB
# include <bits/stdc++.h>
using namespace std;
/*************************************************************************************/
# define endl "\n"
# define io_boost std::ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
typedef unsigned long long int ulli;
typedef long long int lli;
/*************************************JUANKIPEDIA*************************************/
const int MAXN = 200005;
int N, J;
lli a[MAXN];

int main(){
    io_boost;
    cin >> N >> J;
    for(int i = 0; i < N; i++) cin >> a[i];
    lli c = 0;
    int ans = 0;
    for(int i = 0; i < N; i++){
        if(a[i] > (c + J)) ans++, a[i] = c + J;
        c = a[i];
    }
    cout << ans << endl;

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