Submission #1301252

#	Time	Username	Problem	Language	Result	Execution time	Memory
1301252		Euclid73	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	64 ms	6816 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

#define ll long long

const ll MAXN=2e5+5;

ll n, m, a[MAXN];
vector<ll> v, lis;

int main()
{
    cin >> n >> m;
    for (int i=0; i<n; i++)
    {
        cin >> a[i];
    }
    for (int i=1; i<=n; i++)
    {
        if (i*m>=a[i-1])
        {
            v.push_back(i*m-a[i-1]);
        }
    }
    for (auto x:v)
    {
        ll p=upper_bound(lis.begin(), lis.end(), x)-lis.begin();
        if (p==lis.size())
        {
            lis.push_back(x);
        }
        else
        {
            lis[p]=x;
        }
    }
    cout << n-lis.size() << "\n";
}

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