Submission #1164685

#TimeUsernameProblemLanguageResultExecution timeMemory
1164685Ghulam_JunaidRabbit Carrot (LMIO19_triusis)C++20
0 / 100
2 ms328 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main(){ ll n, m; cin >> n >> m; deque<ll> dq; dq.push_front(0); ll ans = 0; for (ll i = 1; i <= n; i ++){ ll x; cin >> x; while (dq.size() and dq.front() + i * m < x){ dq.pop_front(); ans++; } if (dq.size()) dq.push_front(x - i * m); else dq.push_front(0); } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...