Submission #1231668

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231668		nanh0607	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	328 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i=l; i<=r; i++)

void solve() {
    int n, m; cin >> n >> m;
    vector<int> dp(n+1, 1e9);
    dp[0] = 0;

    // aj <= ai + M*(j-i)
    // M*j - aj >= M*i - ai
    // bj >= bi

    int res = 0;
    FOR(i, 1, n) {
        int a; cin >> a;
        int b = m*i-a;
        if (b < 0) continue;
        auto it = lower_bound(dp.begin(), dp.end(), b);
        int idx = it - dp.begin() + 1;
        dp[idx] = min(dp[idx], b);
        res = max(res, idx);
    }
    cout << n-res;
}

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

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