189852025-11-13 19:54:15MagyarKendeSZLGLegtöbb gyümölcs (40 pont)cpp17Accepted 40/406ms2104 KiB
#include <bits/stdc++.h>
using namespace std;
#define int int64_t

int32_t main() {
    cin.tie(0), ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<bool> a(n + 1);
    for (int i = 0; i < n; i++) {
        char c;
        cin >> c;
        a[i + 1] = c == 'K';
    }
    vector<int> ps(n + 1), ss(n + 2);
    for (int i = 1; i <= n; i++) {
        ps[i] = ps[i - 1] + !a[i];
    }
    for (int i = n; i > 0; i--) {
        ss[i] = ss[i + 1] + a[i];
    }
    int result = 0;
    for (int i = 1; i <= n; i++) {
        if (a[i]) continue;
        int ac = ps[i];
        int kc = ss[i + 1];
        result = max(result, min(ac, kc));
    }
    cout << result * 2 << "\n";
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/02ms316 KiB
2Accepted0/06ms2100 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms512 KiB
11Accepted3/33ms1080 KiB
12Accepted3/33ms1080 KiB
13Accepted3/34ms1448 KiB
14Accepted3/34ms1468 KiB
15Accepted3/36ms2024 KiB
16Accepted3/36ms2104 KiB
17Accepted3/36ms2036 KiB