제출 #1070942

#제출 시각아이디문제언어결과실행 시간메모리
1070942raduvRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 200'000; char wasmx[MAXN + 1]; int main() { int n, m, i, prev, x, ans = 0; cin >> n >> m >> prev; if(prev > m){ prev = m; ans++; } for( i = 1; i < n; i++ ){ cin >> x; if(prev + m < x){ ans++; x = prev + m; } prev = x; } cout << ans << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...