hdu 2870（求变化后最大矩形）

题意：w,x,y,z可以变化成对应的a,b,c。求出最大能形成的矩形的面积。

思路：将他们分别变成a,b,c然后求出最大的值。相当于1505，1506的升级版。

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
typedef long long ll;
#define clr(x,y) memset(x,y,sizeof x)
#define INF 0x3f3f3f3f

char s[maxn][maxn];
int a[maxn],L[maxn],R[maxn];
int dp[maxn][maxn];
int n,m;

bool check1(char c)
{
    if( c == 'a' || c == 'w' || c == 'y' || c == 'z' )return true;
    return false;
}
bool check2(char c)
{
    if( c == 'b' || c == 'w' || c == 'x' || c == 'z' )return true;
    return false;
}
bool check3(char c)
{
    if(c == 'c' || c == 'x' || c == 'y' || c == 'z')return true;
    return false;
}

int solve1()
{
    clr(dp,0);
    int ans = 0;
    for(int i = 1;i <= n;i ++)
    {
        for(int j = 1;j <= m;j ++)
        {
            if(check1(s[i][j]))dp[i][j] = dp[i - 1][j] + 1;
            a[j] = dp[i][j];
            L[j] = R[j] = j;
        }
        a[0] = a[m + 1] = -1;
        for(int j = 1;j <= m;j ++)
        {
            while(a[L[j] - 1] >= a[j])
                L[j] = L[L[j] - 1];
        }
        for(int j = m;j >= 1; j --)
        {
            while(a[R[j] + 1] >= a[j])
                R[j] = R[R[j] + 1];
        }
        for(int j = 1;j <= m;j ++)
            ans = max(ans,(R[j] - L[j] + 1) * a[j]);
    }
    return ans;
}
int solve2()
{
    clr(dp,0);
    int ans = 0;
    for(int i = 1;i <= n;i ++)
    {
        for(int j = 1;j <= m;j ++)
        {
            if(check2(s[i][j]))dp[i][j] = dp[i - 1][j] + 1;
            a[j] = dp[i][j];
            L[j] = R[j] = j;
        }
        a[0] = a[m + 1] = -1;
        for(int j = 1;j <= m;j ++)
        {
            while(a[L[j] - 1] >= a[j])
                L[j] = L[L[j] - 1];
        }
        for(int j = m;j >= 1; j --)
        {
            while(a[R[j] + 1] >= a[j])
                R[j] = R[R[j] + 1];
        }
        for(int j = 1;j <= m;j ++)
            ans = max(ans,(R[j] - L[j] + 1) * a[j]);
    }
    return ans;
}
int solve3()
{
    clr(dp,0);
    int ans = 0;
    for(int i = 1;i <= n;i ++)
    {
        for(int j = 1;j <= m;j ++)
        {
            if(check3(s[i][j]))dp[i][j] = dp[i - 1][j] + 1;
            a[j] = dp[i][j];
            L[j] = R[j] = j;
        }
        a[0] = a[m + 1] = -1;
        for(int j = 1;j <= m;j ++)
        {
            while(a[L[j] - 1] >= a[j])
                L[j] = L[L[j] - 1];
        }
        for(int j = m;j >= 1; j --)
        {
            while(a[R[j] + 1] >= a[j])
                R[j] = R[R[j] + 1];
        }
        for(int j = 1;j <= m;j ++)
            ans = max(ans,(R[j] - L[j] + 1) * a[j]);
    }
    return ans;
}
int main()
{

    while( ~ scanf("%d%d",&n,&m))
    {
        for(int i = 1;i <= n;i ++)
        {
            scanf("%s",s[i] + 1);
        }
        int ans = solve1();
        ans = max(ans,solve2());
        ans = max(ans,solve3());
        printf("%d\n",ans);
    }
    return 0;
}