Submission #1147179

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147179		Nelt	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	1095 ms	3368 KiB

triusis

#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, x;
    cin >> n >> x;
    ll a[n + 1];
    for (ll i = 1; i <= n; i++) cin >> a[i];
    ll dp[n + 1];
    a[0] = 0;
    dp[0] = 0;
    for (ll i = 1; i <= n; i++)
    {
        dp[i] = -1e18;
        for (ll j = i - 1; j >= 0; j--) if (a[j] + (i - j) * x >= a[i]) dp[i] = max(dp[i], dp[j] + 1);
    }
    cout << n - *max_element(dp, dp + n + 1) << endl;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t = 1;
    // precomp();
    // cin >> t;
    for (ll cs = 1; cs <= t; cs++)
        solve();
    // cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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