Submission #413734

#	Time	Username	Problem	Language	Result	Execution time	Memory
413734		duyanh1704	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	38 ms	3436 KiB

triusis

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const long long inf = 1e16 + 9;
int n, res;
long long m;
long long a[1000005];

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

    cin >> n >> m;

    int cnt = 0;
    for (int i = 1; i <= n; ++i){
        long long x; cin >> x;
        if (m * i >= x) a[++cnt] = 1LL * m * i - x;
    }

    vector<long long> f(n + 5, inf);
    f[0] = -inf;
    for (int i = 1; i <= cnt; ++i){
        int k = upper_bound(f.begin(), f.end(), a[i]) - f.begin();
        res = max(res, k);
        f[k] = a[i];
    }

    cout << n  - res;
    return 0;
}

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