Submission #1131156

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131156		FaustasK	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	69 ms	3400 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    long long a[n+1];
    a[0]=0;
    for(int i=1; i<=n; i++)
    {
        cin >> a[i];
        a[i]-=m*i;
    }
    vector<long long> dp(n+3, INT64_MAX);
    dp[0]=INT64_MIN;
    for(int i=n; i>=0; i--)
    {
        if(a[i]>0)continue;
        int id = upper_bound(dp.begin(), dp.end(), a[i])-dp.begin();
        dp[id]=a[i];
    }
    for(int i=1; i<dp.size(); i++)
    {
        if(dp[i]==INT64_MAX)
        {
            cout << n-i+2;
            return 0;
        }
    }
    return 0;
}

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