BZOJ 1296: [SCOI2009]粉刷匠 分组DP

//meek
///#include<bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std ;
typedef long long ll;
#define mem(a) memset(a,0,sizeof(a))
#define pb push_back
#define fi first
#define se second
#define MP make_pair

const int N=80;
const ll INF = 1ll<<61;
const int inf = 1<<31;
const int mod= 1000000007;
const int M = 1000000;

char s[N];
int f[N][N],n,m,K,a[N][N];
void DP(int pos) {
   memset(f,0,sizeof(f));
  f[0][0] = 0;
  for(int i=1;i<=m;i++) {
    for(int j=i;j<=m;j++) {
            int cnt[2] = {0};
        for(int k=j;k>=i;k--) {
            cnt[s[k]-‘0‘] ++;
            f[i][j] = max(f[i][j],f[i-1][k-1]+max(cnt[0],cnt[1]));
        }
    }
  }
  for(int i = 1;i <= m; i++) a[pos][i] = f[i][m];
}

int fenzu() {
  int g[N][N*N];
  memset(g,0,sizeof(g));
  g[0][0] = 0;
  for(int i=1;i<=n;i++) {
    for(int j=0;j<=m;j++) {
        for(int k=K;k>=j;k--) g[i][k] = max(g[i][k],g[i-1][k-j]+a[i][j]);
    }
  }
    return g[n][K];
}
int main() {
    scanf("%d%d%d",&n,&m,&K);
    for(int i=1;i<=n;i++) {
       scanf("%s",s+1);
       DP(i);
    }
    printf("%d\n",fenzu());
    return 0;
}