Minimum Operations to Make the Array K-Increasing LeetCode solution in C++

1
class Solution {
2
 public:
3
  int getlis(vector<int> &a) {
4
    vector<int> v;
5
    for (auto p : a) {
6
      auto it = upper_bound(v.begin(), v.end(), p);
7
      if (it == v.end()) {
8
        v.push_back(p);
9
      } else {
10
        *it = p;
11
      }
12
    }
13
    return v.size();
14
  }
15
  int kIncreasing(vector<int> &arr, int k) {
16
    const int n = arr.size();
17
    vector<vector<int>> v(k);
18
    for (int i = 0; i < n; i++) {
19
      v[i % k].push_back(arr[i]);
20
    }
21

22
    int ans = 0;
23
    for (int i = 0; i < k; i++) {
24
      int lis = getlis(v[i]);
25
      ans += v[i].size() - lis;
26
    }
27
    return ans;
28
  }
29
};