Submission #1164670

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164670		Muhammad_Aneeq	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	36 ms	484 KiB

triusis

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <set>
#warning check the output
using namespace std;
#define int long long
inline void solve()
{
    int n,k;
    cin>>n>>k;
    int a[n+1];
    a[0]=0;
    for (int i=1;i<=n;i++)
        cin>>a[i];
    int dp[n]={};
    int ans=n;
    for (int i=1;i<=n;i++)
    {
        dp[i]=n;
        for (int j=0;j<i;j++)
        {
            if (a[i]-a[j]<=(i-j)*k)
                dp[i]=min(dp[i],dp[j]+i-j-1);
        }
        ans=min(ans,dp[i]+n-i);
    }
    cout<<ans<<endl;
}
signed main()
{
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}

Compilation message (stderr)

triusis.cpp:9:2: warning: #warning check the output [-Wcpp]
    9 | #warning check the output
      |  ^~~~~~~

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