hdu 2870 Largest Submatrix 最大子矩阵

题意：wxyz分别可替换成对应的abc，求abc相同子矩阵的最大那个。

分别枚举abc然后跑最大子矩阵即可。

#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
typedef long long ll;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 1010;

int aa[N][N], bb[N][N], cc[N][N];
char a[N][N], b[N][N], c[N][N];
char ch[N][N];
int l1[N], r1[N];
int l2[N], r2[N];
int l3[N], r3[N];
int n, m;

int main()
{
	while( ~scanf("%d%d", &n, &m) ) {
		for( int i = 1; i <= n; ++i ) {
			scanf("%s", ch[i]+1);
			for( int j = 1; j <= m; ++j ) {
				a[i][j] = b[i][j] = c[i][j] = ch[i][j];
				if( a[i][j] == 'w' || a[i][j] == 'y' || a[i][j] == 'z' )
					a[i][j] = 'a';
				if( b[i][j] == 'w' || b[i][j] == 'x' || b[i][j] == 'z' )
					b[i][j] = 'b';
				if( c[i][j] == 'x' || c[i][j] == 'y' || c[i][j] == 'z' )
					c[i][j] = 'c';
			}
		}
		int aaa = -inf, bbb = -inf, ccc = -inf;
		int ans = -inf;
		memset( aa, 0, sizeof( aa ) );
		memset( bb, 0, sizeof( bb ) );
		memset( cc, 0, sizeof( cc ) );
		for( int j = 1; j <= m; ++j ) {
			for( int i = 1; i <= n; ++i ) {
				if( a[i][j] == 'a' ) 
					aa[i][j] = aa[i-1][j]+1;
				if( b[i][j] == 'b' )
					bb[i][j] = bb[i-1][j]+1;
				if( c[i][j] == 'c' )
					cc[i][j] = cc[i-1][j]+1;
			}
		}
		for( int i = 1; i <= n; ++i ) {
			l1[1] = l2[1] = l3[1] = 1, r1[m] = r2[m] = r3[m] = m;
			for( int j = 2; j <= m; ++j ) {
				if( aa[i][j] ) {
					int p = j;
					while( p > 1 && aa[i][p-1] >= aa[i][j] )
						p = l1[p-1];
					l1[j] = p;
				}
				if( bb[i][j] ) {
					int p = j;
					while( p > 1 && bb[i][p-1] >= bb[i][j] )
						p = l2[p-1];
					l2[j] = p;
				}
				if( cc[i][j] ) {
					int p = j;
					while( p > 1 && cc[i][p-1] >= cc[i][j] )
						p = l3[p-1];
					l3[j] = p;
				}
			}
			for( int j = m-1; j >= 2; --j ) {
				if( aa[i][j] ) {
					int p = j;
					while( p < m && aa[i][p+1] >= aa[i][j] )
						p = r1[p+1];
					r1[j] = p;
				}
				if( bb[i][j] ) {
					int p = j;
					while( p < m && bb[i][p+1] >= bb[i][j] )
						p = r2[p+1];
					r2[j] = p;
				}
				if( cc[i][j] ) {
					int p = j;
					while( p < m && cc[i][p+1] >= cc[i][j] )
						p = r3[p+1];
					r3[j] = p;
				}
			}
			for( int j = 1; j <= m; ++j ) {
				//ans = max( ans, mat[i][j] * (r[j] - l[j] + 1) );
				int res = max( aa[i][j] * (r1[j]-l1[j]+1), bb[i][j] * (r2[j]-l2[j]+1) );
				res = max( res, cc[i][j] * (r3[j]-l3[j]+1) );
				ans = max( ans, res );
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}