Submission #1229088

#TimeUsernameProblemLanguageResultExecution timeMemory
1229088nvt2k9Rabbit Carrot (LMIO19_triusis)C++20
0 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; const int N=2e5+7; int a[N]; int main(){ ios_base::sync_with_stdio(false);; cin.tie(0); cout.tie(0); int n,m; cin >> n >> m; for(int i=1 ; i<=n ; i++){ cin >> a[i]; } int cnt=0; a[0]=0; for(int i=1; i<=n; i++){ if(a[i]>a[i-1] && a[i]-a[i-1] > m){ cnt++; } } cout << cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...