Задача №24 егэ по информатике

 with open('24_prob.txt', 'r', encoding='utf-8') as f: 
    text = f.read().strip() 
 
count_A = text.count('A') 
count_O = text.count('O') 
count_consonants = len(text) - count_A - count_O 
 
max_len_subseq = count_consonants + min(count_A, 100) + min(count_O, 100) 
print(max_len_subseq) 
 

 with open('24_prob.txt') as f:
    text = f.readline().strip()
    cntA = cntO = max_len = j = 0
    for i in range(len(text)):
        cntA += text[i] == 'A'
        cntO += text[i] == 'O'
        while cntA > 100 or cntO > 100:
            cntA -= text[j] == 'A'
            cntO -= text[j] == 'O'
            j += 1
        max_len = max(max_len, i - j + 1)
    print(max_len)