Submission #1349074

#TimeUsernameProblemLanguageResultExecution timeMemory
1349074novemnotesRabbit Carrot (LMIO19_triusis)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
const int N(2e5+9);

int n,k,ans=0;
int v[N];

int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	cin >> n >> k;
	for(int i=1;i<=n;i++)cin >> v[i];
	for(int i=0;i<n;i++){
		if(v[i]<v[i+1] && v[i+1]-v[i]>k){
			ans++;
			v[i+1]=v[i]+k;
		}
	}
	cout << ans << "\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...