Submission #1306389

#TimeUsernameProblemLanguageResultExecution timeMemory
1306389SofiatpcRabbit Carrot (LMIO19_triusis)C++20
63 / 100
1097 ms1328 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 2*1e5+5; int a[MAXN], dp[MAXN]; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n,m; cin>>n>>m; for(int i = 1; i <= n; i++)cin>>a[i]; for(int i = n; i >= 0; i--){ dp[i] = MAXN; for(int j = i; j <= n+1; j++) if(a[j] - m*j <= a[i] - m*i) dp[i] = min(dp[i], dp[j] + j-i-1); } cout<<dp[0]<<"\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...