Submission #980798

#	Time	Username	Problem	Language	Result	Execution time	Memory
980798		NoMercy	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	64 ms	12364 KiB

triusis

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

typedef long long ll;

void test_case () {
    int N , K;
    cin >> N >> K;
    int A[N];
    for (int i = 0;i < N;i ++) {
        cin >> A[i];
        A[i] -= K * (i + 1);
    }
    multiset<int> s;
    for (int i = N - 1;i >= 0;i --) {
        // cout << A[i] << " ";
        if (A[i] > 0) {
            continue;
        }
        auto it = s.upper_bound(A[i]);
        if (it != s.end()) {
            s.erase(it);
        }
        s.insert(A[i]);
    }
    // cout << "\n";
    cout << N - (int)s.size() << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);


    int T = 1;
    ///  cin >> T;

    while (T --) {
        test_case ();
    }

    return 0;
}

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