Skip to content

2111. Minimum Operations to Make the Array K-Increasing 👍

  • Time: $O(n\log(n / k))$
  • Space: $O(n / k)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
class Solution {
 public:
  int kIncreasing(vector<int>& arr, int k) {
    int ans = 0;

    for (int i = 0; i < k; ++i) {
      vector<int> arr;
      for (int j = i; j < arr.size(); j += k)
        arr.push_back(arr[j]);
      ans += numReplaced(arr);
    }

    return ans;
  }

 private:
  int numReplaced(const vector<int>& arr) {
    vector<int> tails;
    for (const int a : arr)
      if (tails.empty() || tails.back() <= a)
        tails.push_back(a);
      else
        tails[firstGreater(tails, a)] = a;
    return arr.size() - tails.size();
  }

  int firstGreater(const vector<int>& arr, int target) {
    return ranges::upper_bound(arr, target) - arr.begin();
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
class Solution {
  public int kIncreasing(int[] arr, int k) {
    int ans = 0;

    for (int i = 0; i < k; ++i) {
      List<Integer> arr = new ArrayList<>();
      for (int j = i; j < arr.length; j += k)
        arr.add(arr[j]);
      ans += numReplaced(arr);
    }

    return ans;
  }

  private int numReplaced(List<Integer> arr) {
    List<Integer> tails = new ArrayList<>();
    for (final int a : arr)
      if (tails.isEmpty() || tails.get(tails.size() - 1) <= a)
        tails.add(a);
      else
        tails.set(firstGreater(tails, a), a);
    return arr.size() - tails.size();
  }

  private int firstGreater(List<Integer> arr, int target) {
    final int i = Collections.binarySearch(arr, target + 1);
    return i < 0 ? -i - 1 : i;
  }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
class Solution:
  def kIncreasing(self, arr: list[int], k: int) -> int:
    def numReplaced(arr: list[int]) -> int:
      tails = []
      for a in arr:
        if not tails or tails[-1] <= a:
          tails.append(a)
        else:
          tails[bisect_right(tails, a)] = a
      return len(arr) - len(tails)

    return sum(numReplaced(arr[i::k]) for i in range(k))