Submission #1220705

#	Time	Username	Problem	Language	Result	Execution time	Memory
1220705		thekeems	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	57 ms	3516 KiB

triusis

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

int arr[200005];
vector<int> points;
vector<int> dp;
int n, m;

int main() {
    
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }

    for (int i = 0; i < n; i++) {
        if ((i + 1) * m >= arr[i]) {
            points.push_back((i + 1) * m - arr[i]);
        }
    }

    for (int i : points) {
        int cur = upper_bound(dp.begin(), dp.end(), i) - dp.begin();
        
        if (cur == dp.size()) {
            dp.push_back(i);
        }
        else {
            dp[cur] = i;
        }
    }
    
    cout << n - dp.size() << endl;
}

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