Submission #1229086

#TimeUsernameProblemLanguageResultExecution timeMemory
1229086tutientdRabbit Carrot (LMIO19_triusis)C++20
0 / 100
0 ms328 KiB
#include<bits/stdc++.h> #define int long long #define ff(i,a,b) for(int i=a;i<=b;i++) #define fb(i,a,b) for(int i=a;i>=b;i--) #define all(v) v.begin(),v.end() #define pushb push_back #define DEBUG cout<<"NO ERROR";return; #define re return using namespace std; void faster(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const int N=5e3+5;const int INF=1e9; int n,m;int a[N]; void solve(){ cin>>n>>m; ff(i,1,n) {cin>>a[i];} a[0]=0; int cnt=0; ff(i,0,n-1){ if(a[i+1]-a[i]>m) cnt++; } cout<<cnt; } signed main(){ faster(); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...