Submission #1164766

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164766		SyedSohaib_123	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	1094 ms	2200 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

#define append push_back
#define int long long

const int N=2e5+10,LG=21;
int mod=998244353;

int a[N],dp[N];
int n,m;

void solve(int tst){
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    int mx=0;
    for(int i=1;i<=n;i++){
        for(int j=0;j<i;j++){
            if(a[i]-a[j]<=m*(i-j) and a[i]<=m*i) dp[i]=max(dp[i],dp[j]+1);
        }
        mx=max(mx,dp[i]);
    }
    cout<<n-mx<<endl;
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    // cin >> t;
    for(int i=1;i<=t;i++){
        solve(i);
        // if(i!=t) cout<<endl;
    }
}

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