| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 947233 | VMaksimoski008 | Rabbit Carrot (LMIO19_triusis) | C++14 | 1049 ms | 2396 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;
int main() {
int n, h;
cin >> n >> h;
vector<int> v(n+1), dp(n+1, 0);
for(int i=1; i<=n; i++) cin >> v[i], v[i] = 1ll * h * i - v[i];
for(int i=1; i<=n; i++)
for(int j=0; j<i; j++)
if(v[i] >= v[j] && v[i] >= 0) dp[i] = max(dp[i], dp[j] + 1);
cout << n - *max_element(dp.begin(), dp.end()) << '\n';
return 0;
}| # | 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... | ||||
