#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve()
{
ll n, x;
cin >> n >> x;
ll a[n + 1];
for (ll i = 1; i <= n; i++) cin >> a[i], a[i] -= i * x;
multiset<ll> s;
for (ll i = 1; i <= n; i++)
{
if (a[i] > 0) continue;
auto it = s.lower_bound(a[i]);
if (it != s.begin())
{
it--;
s.erase(it);
s.insert(a[i]);
}
else s.insert(a[i]);
}
cout << n - s.size() << endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// precomp();
// cin >> t;
for (ll cs = 1; cs <= t; cs++)
solve();
// cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\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... |