#include <algorithm> #include <iostream> #include <vector> const int INF = 1e9; using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<int> a; for (int i = 0; i < n; i++){ int x; cin >> x; x = m * (i + 1) - x; if (x >= 0) a.push_back(x); } vector<int> d; for (int i = 0; i < a.size(); i++) { int l = upper_bound(d.begin(), d.end(), a[i]) - d.begin(); if (l == d.size()) d.push_back(a[i]); else d[l] = a[i]; } cout << n - d.size() << '\n'; return 0; }

triusis.cpp: In function 'int main()':
triusis.cpp:19:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   for (int i = 0; i < a.size(); i++) {
      |                   ~~^~~~~~~~~~
triusis.cpp:21:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     if (l == d.size()) d.push_back(a[i]);
      |         ~~^~~~~~~~~~~