#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
int n;
long long m, a[maxn + 1];
vector<long long> v;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; ++i){
cin >> a[i];
a[i] = m * i - a[i];
}
for (int i = 1; i <= n; ++i){
if (a[i] < 0) continue;
int id = upper_bound(v.begin(), v.end(), a[i]) - v.begin();
if (id == v.size()) v.push_back(a[i]);
else v[id] = a[i];
}
cout << n - v.size();
}
# | 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... |