Submission #1368715

#TimeUsernameProblemLanguageResultExecution timeMemory
1368715blueyesRabbit Carrot (LMIO19_triusis)C++20
100 / 100
17 ms2756 KiB
#include <bits/stdc++.h>

using namespace std;

void solve() 
{
    int n, m;
    cin >> n >> m;
    vector<int> a, dp;

    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;

        if (i * m - x >= 0) a.push_back(i * m - x);
    }

    for (auto x : a) {
        auto it = upper_bound(dp.begin(), dp.end(), x);
        if (it == dp.end()) dp.push_back(x);
        else *it = x;
    }

    cout << n - dp.size() << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    //cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...