Submission #1263027

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263027		kaloyan	Rabbit Carrot (LMIO19_triusis)	C++20	35 / 100	1 ms	328 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 10;
const int INF = 1e9;

int N, M;
int a[MAXN];
vector<int> v;
int dp[MAXN];

int upper_binary(int x)
{
    int l = -1, r = N;

    while(r > l + 1)
    {
        int m = (l + r) / 2;

        if(dp[m] > x)
        {
            r = m;
        }
        else
        {
            l = m;
        }
    }

    return r;
}

void solve()
{
    cin >> N >> M;

    for(int i = 1 ; i <= N ; ++i)
    {
        cin >> a[i];
    }

    for(int i = 1 ; i <= N ; ++i)
    {
        if(M * i >= a[i])
        {
            v.push_back(M * i - a[i]);
        }
    }

    for(int i = 1 ; i <= v.size() ; ++i)
    {
        dp[i] = INF;
    }

    dp[0] = -INF;

    for(int val : v)
    {
        int idx = upper_binary(val);

        dp[idx] = val;
    }

    int answer = 0;

    for(int i = 1 ; i <= v.size() ; ++i)
    {
        if(dp[i] < INF)
        {
            answer = i;
        }
    }

    cout << N - answer << "\n";
}

void fastIO()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

int main()
{
    fastIO();
    solve();
}

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