Submission #1229811

#TimeUsernameProblemLanguageResultExecution timeMemory
1229811who-read-is-dogRabbit Carrot (LMIO19_triusis)C++20
0 / 100
2 ms1096 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
vector<int> a(N);
int main(){
    int n; cin >> n;
    int m; cin >> m;
    for(int i = 1; i <= n; i++) cin >> a[i];
    a[0] = 0;
    int NTF = 0;
    int lc = 0;
    for(int i = 1; i <= n; i++){
        if(a[i] - lc > m)
        {
            NTF++;
        } else {
            lc = a[i];
        }
    }
    cout << NTF;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...