fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. const int MaxN=1e4;
  4. int T, N;
  5. int pos[MaxN];
  6. int main(){
  7. cin>>T>>N;
  8. for(int n=0; n<N; n+=1)
  9. cin>>pos[n];
  10. int ans=1;
  11. int pvt=0;
  12. for(int n=0; n<N; n+=1)
  13. if(pos[n]-pvt>T){
  14. ans+=1;
  15. pvt=pos[n-1];
  16. }
  17. cout<<ans;
  18. }
Success #stdin #stdout 0.01s 5280KB
stdin
12 11
3 4 6 8 12 15 16 18 20 23 25
stdout
3