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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
vector<int> fixed;
for (int i = 1; i <= n; i++) {
if (v[i] <= i * m) {
fixed.push_back(i * m - v[i]);
}
}
vector<int> lis;
for (int a : fixed) {
auto it = upper_bound(lis.begin(), lis.end(), a);
if (it == lis.end()) {
lis.push_back(a);
} else {
*it = a;
}
}
cout << n - lis.size() << '\n';
}
# | 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... |