# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199925 | SamAnd | Rabbit Carrot (LMIO19_triusis) | C++17 | 1074 ms | 1764 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.
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int n, m;
int a[N];
int dp[N];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i)
{
dp[i] = N;
for (int j = 0; j < i; ++j)
{
if (a[j] + (i - j) * 1LL * m >= a[i])
dp[i] = min(dp[i], dp[j] + (i - j - 1));
}
}
int ans = n;
for (int i = 1; i <= n; ++i)
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... |