区间DP+背包,感觉比较厉害的题。
/* Footprints In The Blood Soaked Snow */
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 55, maxt = 2505;
int n, m, t, f[maxn][maxn], sum[maxn], dp[maxn][maxt];
char str[maxn];
inline void calc() {
for(int i = 1; i <= m; i++) sum[i] = sum[i - 1] + (str[i] == '1');
for(int i = 1; i <= m; i++) for(int j = 1; j <= m; j++) {
f[j][i] = 0;
for(int l = 0; l < j; l++)
f[j][i] = max(f[j][i], f[l][i - 1] + max(sum[j] - sum[l], j - l - (sum[j] - sum[l])));
}
}
int main() {
scanf("%d%d%d", &n, &m, &t);
for(int id = 1; id <= n; id++) {
scanf("%s", str + 1);
calc();
for(int i = 1; i <= t; i++) {
int upb = min(i, m);
for(int j = 1; j <= upb; j++)
dp[id][i] = max(dp[id][i], dp[id - 1][i - j] + f[m][j]);
}
}
int ans = 0;
for(int i = 1; i <= t; i++) ans = max(ans, dp[n][i]);
printf("%d\n", ans);
return 0;
}