Submission #446888

#	Time	Username	Problem	Language	Result	Execution time	Memory
446888		four_specks	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	41 ms	7496 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

void solve()
{
    int n;
    long m;
    cin >> n >> m;

    vector<long> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];

    vector<long> r(n);
    for (int i = 0; i < n; i++)
        r[i] = -(a[i] - (i + 1) * m);

    vector<long> dp;
    for (int i = 0; i < n; i++)
    {
        if (r[i] >= 0)
        {
            if (int k = upper_bound(dp.begin(), dp.end(), r[i]) - dp.begin(); k == (int)dp.size())
                dp.push_back(r[i]);
            else
                dp[k] = r[i];
        }
    }

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

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

    solve();

    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37