Submission #999586

#	Time	Username	Problem	Language	Result	Execution time	Memory
999586		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	57 ms	5460 KiB

triusis

#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
    int n, m;
    cin >> n >> m;
    vector<int> v(n);
    for(int i = 0; i < n; ++ i) {
        cin >> v[i];
        v[i] -= (i + 1) * m;
        v[i] *= -1;
    }
    vector<int> dp(n + 1, INT_MAX);
    dp[0] = INT_MIN;
    for(int i = 0; i < n; ++ i) {
        if(v[i] < 0) continue;
        int l = (int) (upper_bound(dp.begin(), dp.end(), v[i]) - dp.begin());
        dp[l] = v[i];
    }
    int x = 0;
    for (int l = 0; l <= n; ++ l) {
        if (dp[l] != INT_MAX) {
            x = l;
        }
    }
    cout << n - x << endl;
    return 0;
}

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