# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1117332 | KALARRY | Rabbit Carrot (LMIO19_triusis) | C++14 | 1060 ms | 1696 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//chockolateman
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int N,M,a[200005],dp[200005];
int main()
{
scanf("%d%d",&N,&M);
for(int i = 1 ; i <= N ; i++)
scanf("%d",&a[i]);
int ans = N;
for(int i = 1 ; i <= N ; i++)
{
dp[i] = INF;
for(int j = i-1 ; j >= 0 ; j--) //last not changed is j
{
long long max_reach = a[j] + (i - j)*M;
if(max_reach >= a[i])
dp[i] = min(dp[i],dp[j] + (i-1-j));
}
ans = min(ans,dp[i] + N-i);
}
printf("%d\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |