#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(n);
int cnt = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
a[i] = m * (i + 1) - a[i];
}
vector<int> d;
for (int i = 0; i < n; i++)
{
if (a[i] < 0)
continue;
int ind = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
if (ind == d.size())
d.push_back(a[i]);
else
d[ind] = a[i];
}
cout << n - d.size();
return 0;
}
| # | 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... |