Submission #303883

#	Time	Username	Problem	Language	Result	Execution time	Memory
303883		binary_python	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	195 ms	4976 KiB

triusis

#include <bits/stdc++.h>
#define ll long long

using namespace std;

ll A[200005];


bool cmp(int i, int j) {
    return A[i] <= A[j];
}

int main() {
    int n,m;
    cin >> n >> m;
    for (int i=1; i<=n; i++) {
        ll x;
        cin >> x;
        A[i] = x-m*i;
        A[i] = -1*A[i];
    }
    A[0]=0;
    vector<int> L(1,0);
    L[1] = 0;

    for (int j=1; j<=n; j++) {
        if (A[j] < 0) continue;
        auto it = lower_bound(L.begin(), L.end(), j, cmp);
        if (it == L.end()) {
            L.push_back(j);
        }
        else {
            *it = j;
        }
    }

    cout << n+1 - L.size() << "\n";

    return 0;
}

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