Submission #1012702

#	Time	Username	Problem	Language	Result	Execution time	Memory
1012702		MMihalev	Rabbit Carrot (LMIO19_triusis)	C++14	63 / 100	1020 ms	1884 KiB

triusis

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<tuple>
#include<set>
#include<map>
#include<random>
#include<chrono>
using namespace std;
const int MAX_N=2e5+3;
int a[MAX_N];
int n;
int m;
int dp[MAX_N];
signed main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m;

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

    for(int i=1;i<=n+1;i++)
    {
        dp[i]=-1e9;
    }

    for(int i=1;i<=n+1;i++)
    {
        for(int j=i-1;j>=0;j--)
        {
            if(a[j]+(i-j)*m>=a[i])dp[i]=max(dp[i],dp[j]+1);
        }
    }

    cout<<n-(dp[n+1]-1)<<"\n";

    return 0;
}

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