Submission #1175082

#	Time	Username	Problem	Language	Result	Execution time	Memory
1175082		ducanh0811	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	17 ms	5568 KiB

triusis

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

int n, m;
#define MAXN 200005
int a[MAXN];
int b[MAXN];

void solve(){
    cin >> n >> m;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
        b[i] = m * i - a[i];
    }
    vector<int> v;
    for (int i = 1; i <= n; ++i){
        if (b[i] < 0) continue;
        auto it = upper_bound(v.begin(), v.end(), b[i]);
        if (it == v.end()) {
            v.push_back(b[i]);
        } else *it = b[i];
    }
    cout << n - v.size();
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    solve();
    return 0;
}

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