原题传送门
很好的一个dp
令
表示前
行刷了
次的答案,
表示第
行前
个,刷了
次的最大价值
COde:
#include <bits/stdc++.h>
#define maxn 60
#define maxm 2510
using namespace std;
int n, m, t, f[maxn][maxm], g[maxn][maxn][maxn], sum[maxn][maxn];
char s[maxn];
inline int read(){
int s = 0, w = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
return s * w;
}
int main(){
scanf("%d%d%d", &n, &m, &t);
for (int i = 1; i <= n; ++i){
scanf("%s", s + 1);
for (int j = 1; j <= m; ++j) sum[i][j] = sum[i][j - 1] + (s[j] == '1') ;
}
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= min(m, t); ++j)
for (int k = 1; k <= m; ++k)
for (int l = j - 1; l < k; ++l)
g[i][j][k] = max(g[i][j][k], g[i][j - 1][l] + max(sum[i][k] - sum[i][l], k - l - sum[i][k] + sum[i][l]));
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= t; ++j)
for (int k = 0; k <= min(j, m); ++k)
f[i][j] = max(f[i][j], f[i - 1][j - k] + g[i][k][m]);
int ans = 0;
for (int i = 0; i <= t; ++i) ans = max(ans, f[n][i]);
printf("%d\n", ans);
return 0;
}