Submission #607941

#TimeUsernameProblemLanguageResultExecution timeMemory
607941thienbao1602Rabbit Carrot (LMIO19_triusis)C++17
100 / 100
88 ms11588 KiB
#include    <bits/stdc++.h>
#define ll long long
using namespace std;

ll n, M;
multiset<ll> mst;

void solve()
{
    cin >> n >> M;
    for(int i=1; i<=n; i++)
    {
        ll x;
        cin >> x;

        if (x > M*i) continue;
        x = M*i - x;
        auto it = mst.upper_bound(x);
        if (it != mst.end())
        {
            mst.erase(it);
        }
        mst.insert(x);
    }

    cout << n - (int)mst.size();
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
    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...