# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530595 | clams | Rabbit Carrot (LMIO19_triusis) | C++17 | 27 ms | 8384 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.
/**
* @authors bubu
* @date 2022-02-25 18:25:40
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int& i : a) cin >> i;
vector<int> b;
for (int i = 1; i <= n; i++) {
if (i * m >= a[i - 1]) {
b.push_back(m * i - a[i - 1]);
}
}
vector<int> lnds;
for (int i = 0; i < (int)b.size(); i++) {
int j = upper_bound(lnds.begin(), lnds.end(), b[i]) - lnds.begin();
if (j == lnds.size()) lnds.push_back(b[i]);
else lnds[j] = b[i];
}
cout << n - (int)lnds.size() << '\n';
}
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... |