제출 #519121

#제출 시각아이디문제언어결과실행 시간메모리
519121blueRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms316 KiB
#include <iostream> #include <vector> using namespace std; using vi = vector<int>; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int N, M; cin >> N >> M; vi A(1+N); A[0] = 0; for(int i = 1; i <= N; i++) cin >> A[i]; int ans = 0; for(int i = 1; i <= N; i++) { if(A[i] > A[i-1] + M) { A[i] = A[i-1] + M; ans++; } } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...