Submission #895370

#	Time	Username	Problem	Language	Result	Execution time	Memory
895370		d4xn	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	29 ms	3920 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()

const int N = 2e5+1, inf = INT_MAX;

int n, m, a[N], dp[N];

signed main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n >> m;
  a[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] -= m*i;
  }

  deque<int> dp;
  for (int i = 0; i <= n; i++) {
    auto it = lower_bound(all(dp), a[i]);
    if (it == dp.begin()) dp.push_front(a[i]);
    else {
      if (it == dp.end()) continue;
      
      --it;
      *it = max(*it, a[i]);
    }
  }
  cout << (n+1) - dp.size() << "\n";
}

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