Submission #1299701

#TimeUsernameProblemLanguageResultExecution timeMemory
1299701bethanceRabbit Carrot (LMIO19_triusis)C++20
0 / 100
3 ms572 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,k;
	cin>>n>>k;
	vector<int> poles(n);
	for(int i=0;i<n;i++){
		cin>>poles[i];
	}
	int ans=0;
	for(int i=0;i<n-1;i++){
		if(poles[i+1]-poles[i]>k){
			ans++;
		}
	}
	cout<<ans<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...