199002025-12-29 12:45:42AblablablaLegtöbb gyümölcs (40 pont)cpp17Accepted 40/404ms928 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;

    string s;
    cin >> s;

    vector<int> van(n + 1);
    for(int i = n - 1; i >= 0; i--){
        van[i] = van[i + 1];
        if(s[i] == 'K'){
            van[i]++;
        }
    }

    int alma = 0;
    int ans = 0;

    for(int i = 0; i < n; i++){
        if(s[i] == 'A'){
            alma++;
        }

        ans = max(ans, 2*min(alma, van[i + 1]));
    }

    cout << ans << "\n";
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/04ms820 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms508 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/33ms848 KiB
12Accepted3/33ms564 KiB
13Accepted3/33ms564 KiB
14Accepted3/34ms752 KiB
15Accepted3/34ms892 KiB
16Accepted3/34ms820 KiB
17Accepted3/34ms928 KiB