제출 #541458

#제출 시각아이디문제언어결과실행 시간메모리
541458it111Rabbit Carrot (LMIO19_triusis)C++11
0 / 100
1 ms296 KiB
#include <bits/stdc++.h> using namespace std; int auksciai[200005] = {0}; int galimaKelti[200005] = {0}; int main(){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n,m; cin >> n >> m; for(int i = 1; i<=n; i++){ cin >> auksciai[i]; } int ats = 0; for(int i = 0; i<=n-1; i++){ if(auksciai[i]+m>=auksciai[i+1]){ galimaKelti[i+1] = auksciai[i]+m-auksciai[i+1]; } else if(auksciai[i]+m+galimaKelti[i]>=auksciai[i+1]){ ats++; } else{ ats++; auksciai[i+1] = auksciai[i]+m; } } cout << ats; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...