#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
#define repl(i,x,y) for(ll i=(x);i<(y);i++)
#define repd(i,x,y) for(ll i=(x);i>=(y);i--)
using namespace std;
const int N=1e2+5;
const int M=3e3+5;
ll n,m,t,ans,sum[N],f1[N][M],f2[N][M];
inline ll read() {
ll x=0;char ch=getchar();bool f=0;
while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return f?-x:x;
}
int main() {
n=read(),m=read(),t=read();
rep(k,1,n) {
char ch[N];
scanf("%s",ch+1);
rep(i,1,m) sum[i]=sum[i-1]+(ch[i]=='1');
rep(i,1,m) rep(j,1,m) {
f1[j][i]=0;
rep(mid,0,j-1) f1[j][i]=max(f1[j][i],f1[mid][i-1]+max(sum[j]-sum[mid],j-mid-sum[j]+sum[mid]));
}
rep(i,1,t) rep(j,1,min(i,t)) f2[k][i]=max(f2[k][i],f2[k-1][i-j]+f1[m][j]);
}
rep(i,1,t) ans=max(ans,f2[n][i]);
printf("%lld",ans);
return 0;
}
BZOJ P1296 [SCOI2009]粉刷匠【区间DP】【背包DP】
最新推荐文章于 2022-05-15 15:16:36 发布