Cod sursă (job #691820)

#include <bits/stdc++.h>
#include <unordered_map>
#include <map>

using namespace std;

ifstream fin("test.in");
ofstream fout("test.out");
//-----------------------------------------
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define si set<int>
#define sc set<char>
//-----------------------------------------
#define f(i,s,e) for(int i=s;i<=e;++i)
#define nf(i,s,e) for(i=s;i<e;++i)
#define rf(i,e,s) for(i=e;i>=s;--i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sp <<" "
//------------------------------------------
const int NMAX = 1e2 + 20;
const int KMAX = 1e1 + 5;
const int MOD = 1e5 + 3;
const int INF = 0x3f3f3f3f;
//------------------------------------------
int n, m, k, ct, M, v, t;
int pos[50], a[50], b[50];
//------------------------------------------
void read() {
    fin >> n >> m >> k;
    char c;
    for (int i = 1; i <= n; ++i) {
        fin >> c;
        if (c == 'A') pos[++ct] = i;
    }
}
void solve() {
    t = INF;
    pos[m + 1] = n + 1;
    a[0] = 1;
    for (int i = 1; i <= m + 1; ++i) {
        M = INF;
        for (int j = i - 1; j >= 0 && (pos[i] - i) - (pos[j] - j) <= k; --j) {
            a[i] += a[j];
            M = min(M, b[j]);
        }
        b[i] = M + 1;
    }
    for (int i = m; i >= 0 && (n - m) - (pos[i] - i) <= k; --i) {
        v += a[i];
        t = min(t, b[i]);
    }
    fout << v << " " << t;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    read();
    solve();
    return 0;
}