1121. Divide Array Into Increasing Sequences

Given an integer array nums sorted in non-decreasing order and an integer k, return true if this array can be divided into one or more disjoint increasing subsequences of length at least k, or false otherwise.

class Solution {
public:
    bool canDivideIntoSubsequences(vector<int>& nums, int k) {
        int mafreq = 0, l = 0, r = 0, n = nums.size();
        while(r < n) {
            while(r < n and nums[r] == nums[l]) r++;
            mafreq = max(mafreq, r - l);
            l = r;
        }
        return mafreq * k <= n;
    }
};