Maximum Consecutive Ones

int longestSubSeg(vector<int> &arr , int n, int k){
    int left = 0, right = 0;
    int maxOnes = 0;
    int zerosCount = 0;

    while (right < n) {
        if (arr[right] == 0) {
            zerosCount++;
        }

        while (zerosCount > k) {
            if (arr[left] == 0) {
                zerosCount--;
            }
            left++;
        }

        maxOnes = max(maxOnes, right - left + 1);
        right++;
    }

    return maxOnes;
}