Submission #831062

#TimeUsernameProblemLanguageResultExecution timeMemory
831062Mark241Rabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms1876 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, br, a[200005], sol = 0; cin >> n >> br; for (int i = 0; i < n; i++) { cin >> a[i]; if (i == 0) { if (a[i]>br) sol++; a[i]=br; } else { if (a[i]>a[i-1]+br) { sol++; if (a[i]-(max(a[i-2], a[i-1])+br)<=br) { a[i-1]=max(a[i-1],a[i-2])+br; }else a[i]=a[i-1]+br; } } } cout << sol; 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...