182202025-10-14 14:02:52Zoli9Legtöbb gyümölcs (40 pont)python3Accepted 40/40126ms8704 KiB
n = int(input())
db = int(n/2)
lista = list(input())
sega = [0]*n
segb = [0]*n
if lista[0] == "A":
    sega[0] = 1
    segb[0] = 0
else:
    segb[0] = 1
    sega[0] = 0
maxa = 0
maxb = 0
for i in range(1, n):
    if lista[i]=="A":
        sega[i] = sega[i-1] +1
        segb[i] = segb[i-1]
    else:
        sega[i] = sega[i-1] 
        segb[i] = segb[i-1] +1
    if min(maxa, maxb) < min(sega[i], db-segb[i]):
        maxa = sega[i]
        maxb = db - segb[i]
print(min(maxa, maxb)*2)

SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/016ms3140 KiB
2Accepted0/0125ms8684 KiB
3Accepted2/216ms3120 KiB
4Accepted2/216ms3124 KiB
5Accepted2/216ms3324 KiB
6Accepted2/216ms2936 KiB
7Accepted2/216ms3116 KiB
8Accepted3/317ms3124 KiB
9Accepted3/317ms3124 KiB
10Accepted3/318ms3124 KiB
11Accepted3/357ms5424 KiB
12Accepted3/371ms5876 KiB
13Accepted3/382ms6444 KiB
14Accepted3/392ms7020 KiB
15Accepted3/3119ms8440 KiB
16Accepted3/3126ms8704 KiB
17Accepted3/3111ms8200 KiB