# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091713 | vjudge1 | Rabbit Carrot (LMIO19_triusis) | C++17 | 54 ms | 5408 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;
vector <int> h, hp;
int lnds() {
vector<int> sub;
for (int i = 0; i < hp.size(); i++) {
int x = hp[i];
if (sub.empty() || sub[sub.size() - 1] <= x) {
sub.push_back(x);
}
else {
int idx = upper_bound(sub.begin(), sub.end(), x) - sub.begin();
sub[idx] = x;
}
}
return sub.size();
}
int main() {
int n, jh;
cin >> n >> jh;
for (int i = 0; i < n; i++){
int x;
cin >> x;
h.push_back(x);
}
for (int i = 1; i <= n; i++) {
if (i * jh >= h[i-1]) hp.push_back(i * jh - h[i-1]);
}
cout << n - lnds() << endl;
}
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... |