Submission #1276870

#	Time	Username	Problem	Language	Result	Execution time	Memory
1276870		zhaoxw	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	64 ms	3104 KiB

triusis

#include<bits/stdc++.h>
using namespace std;
const int MAX_N = 200005;
int a[MAX_N],b[MAX_N],n,m;
vector<int> dp;
int main()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        b[i] = m*i-a[i];
    }
    for(int i = 1;i <= n;i++)
    {
        if(b[i] < 0) continue;
        auto it = upper_bound(dp.begin(),dp.end(),b[i]);
        int x = it-dp.begin();
        if(x == dp.size()) dp.push_back(b[i]);
        else dp[x] = b[i];
    }
    cout << n-dp.size() << '\n';
    return 0;
}

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