Submission #542836

#	Time	Username	Problem	Language	Result	Execution time	Memory
542836		Saeed_247	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	31 ms	4988 KiB

triusis

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

const int N = 2e5 + 10;
long long n, m, arr[N];
vector<int> bad;

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> arr[i];
    }
    for (int i = 1; i <= n; i++) {
        if (i * m >= arr[i]) {
            auto it = upper_bound(bad.begin(), bad.end(), i * m - arr[i]);
            if (it == bad.end()) bad.push_back(i * m - arr[i]);
            else *it = i * m - arr[i];
        }
    }
    cout << n - bad.size() << '\n';
    return 0;
}

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