228772026-01-15 23:05:57BucsMateLegtöbb gyümölcs (40 pont)cpp17Accepted 40/404ms564 KiB
#include <iostream>

using namespace std;

char str[100002];

int main()
{
    int N;
    cin >> N >> str;
    int count_A = 0, count_K = N/2;
    int result = 0;
    for(int i = 0; str[i] != '\0'; i++){
        if(str[i] == 'K'){
            count_K--;
        }
        else{
            count_A++;
        }
        if(result < 2*min(count_A, count_K)){
            result = 2*min(count_A, count_K);
        }
    }
    cout << result;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/04ms508 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms508 KiB
7Accepted2/21ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/32ms316 KiB
10Accepted3/32ms316 KiB
11Accepted3/33ms316 KiB
12Accepted3/33ms316 KiB
13Accepted3/33ms424 KiB
14Accepted3/33ms352 KiB
15Accepted3/34ms564 KiB
16Accepted3/34ms316 KiB
17Accepted3/33ms492 KiB