231692026-01-16 15:28:18Erik_GepardLegtöbb gyümölcs (40 pont)cpp17Accepted 40/406ms808 KiB
#include <bits/stdc++.h>

using namespace std;

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

    int l=0, r=n/2+1, m;
    while(l+1<r){
        m=(l+r)/2;
        int db=0;
        for(int i=0; i<n; i++){
            if(db<m&&s[i]=='A'){
                db++;
            }
            else if(db>=m&&s[i]=='K'){
                db++;
            }
        }
        if(db>=2*m){
            l=m;
        }
        else {
            r=m;
        }
    }

    cout<<l*2<<"\n";

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/06ms624 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms508 KiB
10Accepted3/31ms356 KiB
11Accepted3/33ms508 KiB
12Accepted3/34ms552 KiB
13Accepted3/34ms560 KiB
14Accepted3/34ms808 KiB
15Accepted3/36ms500 KiB
16Accepted3/36ms564 KiB
17Accepted3/34ms616 KiB