Submission #821697

#	Time	Username	Problem	Language	Result	Execution time	Memory
821697		Youssif_Elkadi	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	74 ms	5340 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5, M = 11, inf = 1e9 + 5, mod = 1e9 + 7;
long long dp[N];
long long n, m;
long long arr[N];
int main()
{
    cin >> n >> m;
    dp[0] = 0;
    long long mx = 0;
    for (long long i = 1; i <= n; i++)
        dp[i] = inf;
    arr[0] = 0;
    bool flag = 0;
    for (long long i = 1; i <= n; i++)
    {
        cin >> arr[i];
        if (arr[i] <= m * i)
        {
            arr[i] = m * i - arr[i];
            long long it = upper_bound(dp, dp + n + 1, arr[i]) - dp;
            mx = max(mx, it);
            dp[it] = arr[i];
        }
    }
    cout << n - mx + flag;
}

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