# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088629 | vjudge1 | Rabbit Carrot (LMIO19_triusis) | C++17 | 19 ms | 4504 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 <algorithm>
#include <iostream>
#include <vector>
const int INF = 1e9;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m; cin >> n >> m;
vector<int> a;
for (int i = 0; i < n; i++){
int x; cin >> x; x = m * (i + 1) - x;
if (x >= 0) a.push_back(x);
}
vector<int> d;
for (int i = 0; i < a.size(); i++) {
int l = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
if (l == d.size()) d.push_back(a[i]);
else d[l] = a[i];
}
cout << n - d.size() << '\n';
return 0;
}
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... |