【BZOJ 1296 [SCOI2009]粉刷匠】dp

BZOJ 1296
题意 容易想到分组背包那步
但是dp那步我又想槽了
看一下代码吧 上面是处理每一行的dp值
下面是处理分组背包值

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 105;
int f[MAX_N][2502],sum[MAX_N],dp[MAX_N][MAX_N];
char str[MAX_N];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,t;
    scanf("%d%d%d",&n,&m,&t);
    for(int i = 1;i<=n;++i)
    {
        scanf("%s",str+1);sum[0] = 0;
        memset(dp,0,sizeof(dp));
        for(int j = 1;j<=m;++j) sum[j] = sum[j-1] + (str[j]=='1'?1:0);
        for(int ii = 1;ii<=m;++ii)
        {
            for(int k = 1;k<=ii&&k<=t;++k)
            {
                for(int j = k - 1;j<ii;++j)
                {
                    dp[ii][k] = max(dp[ii][k],dp[j][k-1] + max(sum[ii]-sum[j],ii-j-sum[ii]+sum[j]));
                }
            }
        }
        for(int j = t;j>=0;--j)
        {
            for(int k = 0;k<=m&&k<=j;++k)
            {
                f[i][j] = max(f[i][j],f[i-1][j-k]+dp[m][k]);
            }
        }
    }
    printf("%d\n",f[n][t]);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}