#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<int> a(n), b(n); for (int i = 0; i < n; ++i) { cin >> a[i]; b[i] = a[i] - i * m; } vector<int> lis; for (int i = 0; i < n; ++i) { auto it = upper_bound(lis.begin(), lis.end(), b[i], greater<>()); if (it == lis.end()) { lis.push_back(b[i]); } else { *it = b[i]; } } cout << n - lis.size() << '\n'; }