hdu 4328 最大子矩阵（DP）

求最大子矩阵，可以使交叉颜色的方块

第一，第二两种情况直接就是王知昆的论文里面的，难点的就是第三种情况

第三种怎么想呢，

依然还是有三个记录  right left high  分标表示能够向右 向左向上的最大延伸，然后怎么更新延伸呢，只要是相邻两个是不一样颜色的就能延伸，否则就置为1

然后就基本是一样的了

AC代码如下：

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

#define MAX 0x3f3f3f3f

char maps[1100][1100];
int num[1100][1100], lf[1100][1100], rt[1100][1100], high[1100][1100];
int N, M;

int solve1(){
    memset( lf, 0, sizeof( lf ) );
    memset( rt, 0, sizeof( rt ) );
    memset( high, 0, sizeof( high ) );
    int ans = 0;

    for( int i = 1; i <= N; i++ ){

        for( int j = 1; j <= M; j++ ){
            if( num[i][j] ) lf[i][j] = 1 + lf[i][j-1];
            else    lf[i][j] = 0;
        }
        for( int j = M; j >= 1; j-- ){
            if( num[i][j] ) rt[i][j] = 1 + rt[i][j+1];
            else    rt[i][j] = 0;
        }

        for( int j = 1; j <= M; j++ ){
            if( num[i][j] == 0 ){
                high[i][j] = 0;
                continue;
            }else if( num[i-1][j] == 0 ){
                high[i][j] = 1;
                ans = max( ans, ( rt[i][j] + lf[i][j] - 1 + 1 ) * 2 );
            }else{
                high[i][j] = high[i-1][j] + 1;
                rt[i][j] = min( rt[i][j], rt[i-1][j] );
                lf[i][j] = min( lf[i][j], lf[i-1][j] );
                ans = max( ans, ( rt[i][j] + lf[i][j] - 1 + high[i][j] ) * 2 );
            }
        }
    }

    return ans;
}

int solve2(){
    memset( lf, 0, sizeof( lf ) );
    memset( rt, 0, sizeof( rt ) );
    memset( high, 0, sizeof( high ) );
    int ans = 0;

    for( int i = 0; i <= M; i++ ){
        lf[0][i] = rt[0][i] = MAX;
    }

    for( int i = 1; i <= N; i++ ){

        for( int j = 1; j <= M; j++ ){
            if( maps[i][j] != maps[i][j-1] ) lf[i][j] = 1 + lf[i][j-1];
            else    lf[i][j] = 1;
        }
        for( int j = M; j >= 1; j-- ){
            if( maps[i][j] != maps[i][j+1] ) rt[i][j] = 1 + rt[i][j+1];
            else    rt[i][j] = 1;
        }

        for( int j = 1; j <= M; j++ ){
            if( maps[i][j] == maps[i-1][j] ){
                high[i][j] = 1;
                ans = max( ans, ( rt[i][j] + lf[i][j] - 1 + 1 ) * 2 );
            }else{
                high[i][j] = high[i-1][j] + 1;
                rt[i][j] = min( rt[i][j], rt[i-1][j] );
                lf[i][j] = min( lf[i][j], lf[i-1][j] );
                ans = max( ans, ( rt[i][j] + lf[i][j] - 1 + high[i][j] ) * 2 );
            }
        }
    }

    return ans;
}

int main(){
    int T, Case = 1, ans;

    scanf( "%d", &T );
    while( T-- ){

        scanf( "%d%d", &N, &M );
        for( int i = 1; i <= N; i++ ){
            scanf( "%s", &maps[i][1] );
        }

        ans = 0;
        memset( num, 0, sizeof( num ) );
        //1
        for( int i = 1; i <= N; i++ ){
            for( int j = 1; j <= M; j++ ){
                if( maps[i][j] == 'B' ) num[i][j] = 1;
                else num[i][j] = 0;
            }
        }
        ans = max( ans, solve1() );
        //2
        for( int i = 1; i <= N; i++ ){
            for( int j = 1; j <= M; j++ ){
                if( maps[i][j] == 'R' ) num[i][j] = 1;
                else num[i][j] = 0;
            }
        }
        ans = max( ans, solve1() );
        //3
        ans = max( ans, solve2() );

        printf( "Case #%d: %d\n", Case++, ans );
    }

    return 0;
}
/*
1
4 4
RBRB
BRBR
RBRB
BRBR

*/