Submission #1164730

#TimeUsernameProblemLanguageResultExecution timeMemory
1164730Ghulam_JunaidRabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 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() + m < x){
            dq.pop_front();
            ans++;
        }

        if (dq.size()){
            for (int j = 0; j < dq.size(); j ++)
                dq[j] += m;
            dq.push_front(x);
        }
        else{
            dq.push_front(i * m);
        }
    }
    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...