제출 #1229092

#제출 시각아이디문제언어결과실행 시간메모리
1229092tutientdRabbit Carrot (LMIO19_triusis)C++20
0 / 100
2 ms328 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<int> a(n + 1); a[0] = 0; for (int i = 1; i <= n; ++i) cin >> a[i]; int res = 0; for (int i = 1; i <= n; ++i) { if (a[i] - a[i - 1] > m) { res++; a[i] = a[i - 1] + m; } } 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...