This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
const int N = 507;
int n, k;
string s;
int a[N];
int dp[N][N];
int main() {
cin.tie(0)->sync_with_stdio(false);
cin >> n >> k >> s;
s = " " + s;
int idx = 1, cnt = 1;
for (int i = 1; i <= 2 * n; i++) {
if (s[i] == 'A')
cnt++;
else
a[idx++] = cnt;
}
memset(dp, 0x3f, sizeof(dp));
dp[1][0] = 0;
for (int i = 2; i <= n + 1; i++) {
int sum = 0;
for (int j = i - 1; j >= 1; j--) {
sum += max(0, i - a[j]);
for (int c = 1; c <= k; c++)
dp[i][c] = min(dp[i][c], dp[j][c - 1] + sum);
}
}
cout << *min_element(dp[n + 1], dp[n + 1] + k + 1) << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |