Submission #1134059

#TimeUsernameProblemLanguageResultExecution timeMemory
1134059alexddRabbit Carrot (LMIO19_triusis)C++20
63 / 100
1096 ms2404 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9;
int n,m;
int a[200005],dp[200005];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    n++;
    a[n]=0;
    for(int i=1;i<=n;i++)
    {
        dp[i] = INF;
        for(int j=i-1;j>=0;j--)
        {
            if(a[j] >= a[i]-(i-j)*m)
            {
                dp[i] = min(dp[i], dp[j] + i-j-1);
            }
            else
            {

            }
        }
        if(dp[i]==INF)
        {
            dp[i]=i;
            a[i]=m*i;
        }
    }
    cout<<dp[n];
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...