int longestOnes(int* A, int ASize, int K) {
    if (ASize < K) {
        return ASize;
    }
    int left = 0, right = 0, res = 0;
    int temp = 0;
    A[left] ? 0 : temp++;
    while (left < ASize && right < ASize) {
        if (temp <= K) {
            res = res > right - left + 1 ? res : right - left + 1;
            right++;
            A[right] ? 0 : temp++;
        }
        else {
            A[left] ? 0 : temp--;
            left++;
        }
    }
    return res;
}