cf_225/C_Barcode

這個DP，感覺很簡單，由於題目要求控制每一列都需要一樣的顏色，所以row基本沒有起什麼作用
這裏我的設置的狀態dp[i][j] 表示前i個滿足題目要求且第i個的顏色爲j的最少花費
dp[i][j] = min{dp[k][!j]+cost[k+1][i]}, rst = min(dp[n][0], dp[n][1])

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define BLACK   0
#define COLOR   2
#define MAXN    1001

char graph[MAXN][MAXN];
int f[MAXN][COLOR], cost[MAXN][COLOR];

int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
        freopen("test.in", "r", stdin);
#endif
        int row, col, x, y, rst_black, rst_white, tmp;
        while( ~scanf("%d %d %d %d", &row, &col, &x, &y) ) {
                for(int i = 0; i < row; i ++) {
                        scanf("%s", graph[i]);
                }
                for(int i = 0; i <= col; i ++) {
                        memset(f[i], 0x3F, sizeof(f[i]));
                }
                for(int j = 0; j < col; j ++) {
                        rst_black = rst_white = 0;
                        for(int i = 0; i < row; i ++) {
                                if( '.' == graph[i][j] ) {
                                        rst_black ++;
                                }
                                else if( '#' == graph[i][j] ) {
                                        rst_white ++;
                                }
                        }
                        cost[j+1][BLACK] = row-rst_white; cost[j+1][!BLACK] = row-rst_black;
                }
                f[0][BLACK] = f[0][!BLACK] = 0;
                for(int i = 1; i <= col; i ++) {
                        for(int k = x; k <= y && i-k+1 >= 1; k ++) {
                                rst_black = rst_white = 0;
                                for(int z = i; z >= i-k+1; z --) {
                                        rst_black += cost[z][BLACK]; rst_white += cost[z][!BLACK];
                                }
                                f[i][BLACK] = min(f[i][BLACK], f[i-k][!BLACK]+rst_black);
                                f[i][!BLACK] = min(f[i][!BLACK], f[i-k][BLACK]+rst_white);
                        }
                }
                printf("%d\n", min(f[col][BLACK], f[col][!BLACK]));
        }
        return 0;
}