제출 #1229043

#제출 시각아이디문제언어결과실행 시간메모리
1229043shiovnRabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int a[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for(int i = 1; i <= n; ++i) cin >> a[i]; int res = 0; int prev = 0; for(int i = 1; i <= n; ++i) { if(a[i] - prev > m) { res++; prev += m; } else { prev = a[i]; } } cout<<res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...