Editing 3823 - A - Flipped Cards (section)

= Explicație ==
Pentru primul exemplu : putem transforma tot stringul in valori de 1 in 2 operatii, prima operatie la
pozitia 2 si a doua la pozitia 5.
Pentru al doilea exemplu : niste exemple de secvente care contin doar valori de 1 si sunt formate prin
4 operatii ar avea capetele: {1,6}, {2,6}, {1,9} .....
<br>

== Exemplul 2 ==
; 
<br>

== Rezolvare ==
<syntaxhighlight lang="python" line>
def max_length_of_sequence(N, K, cards):
    max_len = 0
    count_zeroes = 0
    left, right = 0, 0

    while right < N:
        if cards[right] == '0':
            count_zeroes += 1

        while count_zeroes > K:
            if cards[left] == '0':
                count_zeroes -= 1
            left += 1

        max_len = max(max_len, right - left + 1)
        right += 1

    return max_len

def count_sequences(N, K, cards):
    count = 0
    count_zeroes = 0
    left, right = 0, 0

    while right < N:
        if cards[right] == '0':
            count_zeroes += 1

        while count_zeroes > K:
            if cards[left] == '0':
                count_zeroes -= 1
            left += 1

        if count_zeroes == K:
            count += N - right

        right += 1

    return count

def solve_problem(C, N, K, cards):
    if C == 1:
        return max_length_of_sequence(N, K, cards)
    elif C == 2:
        return count_sequences(N, K, cards)

def read_input(file_name):
    with open(file_name, 'r') as file:
        line = file.readline().strip().split()
        C, N, K = map(int, line)
        cards = file.readline().strip()
    return C, N, K, cards

def write_output(file_name, result):
    with open(file_name, 'w') as file:
        file.write(str(result))

def main():
    C, N, K, cards = read_input("flipc.in")
    result = solve_problem(C, N, K, cards)
    write_output("flipc.out", result)

if __name__ == "__main__":
    main()

</syntaxhighlight>