bzoj 1296: [SCOI2009]粉刷匠 动态规划

Code:

#include<bits/stdc++.h>
#define setIO(s) freopen(s".in","r",stdin) 
#define maxn 1200000 
using namespace std;
int g[52][52][2600],f[52][2600],col[52][52]; 
char str[60]; 
void Max(int &a,int b){ if(b>a)a=b;  }
int main(){
    // setIO("input");  
    int n,m,T; 
    scanf("%d%d%d",&n,&m,&T);
    for(int i=1;i<=n;++i) {
        scanf("%s",str+1); 
        for(int j=1;j<=m;++j){
            if(str[j]=='0') 
                col[i][j]=0; 
            else 
                col[i][j]=1; 
            col[i][j]+=col[i][j-1]; 
        }       
    }        
    for(int i=1;i<=n;++i) 
        for(int k=1;k<=m;++k)  //j次 
            for(int j=1;j<=m;++j) 
                for(int q=k-1;q<j;++q) 
                    Max(g[i][j][k],g[i][q][k-1]+max(j-q-(col[i][j]-col[i][q]),col[i][j]-col[i][q]));  
    for(int i=1;i<=n;++i) 
        for(int j=1;j<=T;++j) 
            for(int k=0;k<=min(j,m);++k) Max(f[i][j],f[i-1][j-k]+g[i][m][k]); 
    int ans=0; 
    for(int i=1;i<=T;++i)  Max(ans,f[n][i]); 
    printf("%d",ans); 
    return 0; 
}

  

猜你喜欢

转载自www.cnblogs.com/guangheli/p/10909698.html