Submission #1108309

#	Time	Username	Problem	Language	Result	Execution time	Memory
1108309		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	22 ms	7000 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"

void solve()
{
    ll n, m;
    cin >> n >> m;
    vector<ll> arr(n);
    for (ll i = 0; i < n; i++)
        cin >> arr[i];

    for (ll i = 0; i < n; i++)
        arr[i] -= (i + 1) * m;

    reverse(arr.begin(), arr.end());
    vector<ll> seq;
    seq.push_back(-1e9);
    for (ll i = 0; i < n; i++)
    {
        if (arr[i] > 0)
            continue;
        else if (seq.back() <= arr[i])
            seq.push_back(arr[i]);
        else
        {
            ll ind = upper_bound(seq.begin(), seq.end(), arr[i]) - seq.begin();
            seq[ind] = arr[i];
        }
    }

    cout << n - (ll)seq.size() + 1 << endl;
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

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

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

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