Submission #1309427

#	Time	Username	Problem	Language	Result	Execution time	Memory
1309427		ramzialoulou	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	29 ms	3576 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  vector<int64_t> a(n);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    a[i] = int64_t(i + 1) * m - x;
  }
  vector<int64_t> best(n, LLONG_MAX);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] >= 0) {
      int j = upper_bound(best.begin(), best.end(), a[i]) - best.begin();
      best[j] = min(best[j], a[i]);
      ans = max(ans, j + 1);
    }
  }
  cout << n - ans << '\n';
  return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37