제출 #1228987

#제출 시각아이디문제언어결과실행 시간메모리
1228987nguthianmangcayRabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms328 KiB
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+3;
const long long inf=1e18+3;
#define ll long long
#define fi first
#define se second
#define pi pair
int a[N];
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    int kq=0;
    for(int i=1;i<=n;i++){
        if(a[i-1]+k < a[i]){
           kq++;
           a[i]=a[i]-(a[i]-a[i-1]-k);
        }
    }
    cout<<kq<<" ";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...