# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890597 | NoLove | Rabbit Carrot (LMIO19_triusis) | C++14 | 1027 ms | 3928 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.
/**
* author : Lăng Trọng Đạt
* created: 21-12-2023
**/
#include <bits/stdc++.h>
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define int int64_t
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define all(v) (v).begin(), (v).end()
using pii = pair<int, int>;
const int MAXN = 2e5 + 5;
int g[MAXN], dp[MAXN];
int n, x;
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("hi.inp", "r")) {
freopen("hi.inp", "r", stdin);
// freopen("hi.out", "w", stdout);
}
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> g[i];
g[i] -= i * x;
}
memset(dp, 0x3f3f, sizeof(dp));
// if (g[1] > 0) {
// g[1] = 0;
// dp[1] = 1;
// }
// g[0] = -x;
dp[0] = 0;
for (int j = 1; j <= n + 1; j++) {
for (int i = 0; i < j; i++) {
if (g[i] >= g[j] or j == n + 1) {
dp[j] = min(dp[j], dp[i] + (j - i - 1));
}
}
db(dp[j])
}
cout << dp[n + 1];
}
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... |