hdu 2870 Largest Submatrix（最大子矩阵变式）

题目：统计一个字母矩阵中最大的相同字母的面积，有些字母可以换成其他字母。

分析：计算分三种分别换成a，b，c求出最大的子矩阵，求出最大即可。

            然后就是hdu1505

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 200010
#define MOD 1000000007

int ans;
int n,m;
char s[1010][1010];
int mp[1010][1010];
void solve(char a,char b,char c,char d)
{
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
        {
            mp[i][j] = 0;
            if(s[i][j] == a || s[i][j] == b)
                mp[i][j] = 1;
            if(s[i][j] == c || s[i][j] == d)
                mp[i][j] = 1;
            if(i > 0 && mp[i][j])
                mp[i][j] += mp[i-1][j];
        }
    int l[1010],r[1010];
    int cnt = 0;
    for(int i = 0; i < n; i++)
    {
        l[0] = 0;
        for(int j = 1; j < m; j++)
        {
            int k = j;
            while(mp[i][k-1] >= mp[i][j] && k > 0)
                k = l[k-1];
            l[j] = k;
        }
        r[m-1] = m-1;
        for(int j = m-2; j >= 0; j--)
        {
            int k = j;
            while(mp[i][k+1] >= mp[i][j] && k < m-1)
                k = r[k+1];
            r[j] = k;
        }
        for(int j = 0; j < m; j++)
            cnt = max(cnt,(r[j]-l[j]+1)*mp[i][j]);
    }
    ans = max(ans,cnt);
}
int main()
{
    int t;
    //scanf("%d",&t);
    while(scanf("%d%d",&n,&m) != EOF)
    {
        for(int i = 0; i < n; i++)
            scanf("%s",s[i]);
        ans = 0;
        solve('a','w','y','z');
        solve('b','w','x','z');
        solve('c','x','y','z');
        printf("%d\n",ans);
    }
    return 0;
}