Submission #814683

#	Time	Username	Problem	Language	Result	Execution time	Memory
814683		winthemcut3	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	30 ms	3684 KiB

triusis

#include <bits/stdc++.h>
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define PB push_back
#define ALL(v) (v).begin(), (v).end()
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define fi   first
#define se   second
#define BIT(x, i) (((x) >> (i)) & 1)
using namespace std;

/** END OF TEMPLATE **/

const int mxN = 2e5 + 5;
int n, m;
int a[mxN];
int L[mxN];
int main()
{
    FastIO;
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    cin >> n >> m;
    FOR(i, 1, n) {
        cin >> a[i];
        a[i] = i*m - a[i];
    }
    int len = 0;
    FOR(i, 1, n) {
        if(a[i] < 0) continue;
        int id = upper_bound(L+1, L+len+1, a[i]) - L;
        L[id] = a[i];
        len = max(len, id);
    }
    cout << n - len;
    return 0;
}

/*

*/

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