Submission #1317246

#TimeUsernameProblemLanguageResultExecution timeMemory
1317246s101gRabbit Carrot (LMIO19_triusis)C++20
100 / 100
68 ms4128 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
    ll n, m;
    cin >> n >> m;
    vector<ll> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        a[i] = m * (i + 1) - a[i];
    }
    vector<ll> d;
    for (int i = 0; i < n; i++)
    {
        if (a[i] < 0)
            continue;
        int ind = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
        if (ind == d.size())
            d.push_back(a[i]);
        else
            d[ind] = a[i];
    }
    cout << n - d.size();
    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...