| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1346746 | nathlol2 | Rabbit Carrot (LMIO19_triusis) | C++20 | 1096 ms | 1432 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, INF = 2e9;
int n, m, ans, a[N], dp[N];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for(int i = 1;i<=n;i++) cin >> a[i];
for(int i = 1;i<=n + 1;i++){
dp[i] = INF;
for(int j = i - 1;j>=0;j--){
if(a[j] + m * (i - j) >= a[i]){
dp[i] = min(dp[i], dp[j] + i - j - 1);
}
}
}
cout << dp[n + 1];
}| # | 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... | ||||
