Submission #797535

#	Time	Username	Problem	Language	Result	Execution time	Memory
797535		gtm7	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	75 ms	6928 KiB

triusis

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

int main()
{
    long long n, m;
    cin >> n >> m;
    vector<long long> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        a[i] = a[i] - m * (i + 1);
    }
    vector<long long> l(2 * n + 2, -1000000000000000);
    l[0] = -l[0];
    for (int i = 1; i <= n; i++)
    {
        l[i] = 0;
    }
    l[n + 1] = 0;
    long long ans = n + 1, ind = -1;
    for (int i = 0; i < n; i++)
    {
        ind = upper_bound(l.begin(), l.end(), a[i], greater<long long>()) - l.begin();
        l[ind] = a[i];
        ans = max(ans, ind);
    }
    cout << 2 * n + 1 - ans << endl;
    return 0;
}

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