# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299415 | Bruteforceman | Rabbit Carrot (LMIO19_triusis) | C++11 | 1051 ms | 1788 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 maxn = 2e5 + 10;
const int inf = 1e8;
int a[maxn], dp[maxn];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int ans = 0;
dp[0] = 0;
for(int i = 1; i <= n; i++) {
dp[i] = -inf;
for(int j = 0; j < i; j++) {
if(a[i] - a[j] <= 1LL * k * (i - j)) {
dp[i] = max(dp[i], 1 + dp[j]);
}
}
ans = max(ans, dp[i]);
}
cout << n - ans << endl;
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... |