Submission #1277619

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277619		k12_khoi	Rabbit Carrot (LMIO19_triusis)	C++17	63 / 100	1095 ms	1460 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

const int N=2e5+5;
const int oo=1e9+1;

int n,k;
int a[N];

namespace sub3
{
    int dp[N][2];

    void solve()
    {
        dp[0][0]=0;
        dp[0][1]=oo;
        for (int i=1;i<=n;i++)
        {
            dp[i][0]=oo;
            dp[i][1]=min(dp[i-1][0],dp[i-1][1])+1;
            for (int j=0;j<i;j++)
            if (a[i]-a[j]<=(i-j)*k) dp[i][0]=min(dp[i][0],dp[j][0]+i-j-1);
        }

        cout << min(dp[n][0],dp[n][1]);
    }
}

int main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL); cout.tie(NULL);

    cin >> n >> k;

    a[0]=0;
    for (int i=1;i<=n;i++)
    cin >> a[i];

    sub3::solve();
}

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