python LIS - TC(nlogn)
\ndef kIncreasing(self, arr: List[int], k: int) -> int: \n\tdef lis(nums):\n\t\tans = [nums[0]]\n\t\tfor n in nums[1:]:\n\t\t\tif ans[-1]<=n:\n\t\t\t\tans.appen
```\ndef kIncreasing(self, arr: List[int], k: int) -> int: \n\tdef lis(nums):\n\t\tans = [nums[0]]\n\t\tfor n in nums[1:]:\n\t\t\tif ans[-1]<=n:\n\t\t\t\tans.append(n)\n\t\t\telse:\n\t\t\t\tidx = bisect.bisect(ans, n)\n\t\t\t\tans[idx] = n\n\t\treturn len(ans)\n\n\tres = 0\n\tfor i in range(k):\n\t\tcans = []\n\t\twhile(i<len(arr)):\n\t\t\tcans.append(arr[i])\n\t\t\ti += k\n\t\tres += (len(cans)-lis(cans))\n\n\treturn res\n```
[]