hdu1 1008 Maximal submatrix （dp）

题意：在给出的 n × m 矩阵里找到每列不递减的最大子矩阵的大小并输出。

思路：用 dp[ i ][ j ] 表示是否满足每列不减，当满足条件时 dp[ i ][ j ] = dp[ i - 1][ j ] + 1;不满足条件时，dp[ i ][ j ] = 1;最后循环每行，判断连续的个数 × 其中dp值的最小值就是答案。

accode:

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;
typedef long long ll;
const int maxn = 2010;
const int N = 4e6 + 10;
ll a[maxn][maxn], dp[maxn][maxn];
#define max(a, b) (a > b) ? a : b
#define min(a, b) (a < b) ? a : b

int main()
{
    int T, n, m;
    ll cnt, minn, ans;
    scanf("%d", &T);
    while(T--)
    {
        memset(dp, 0, sizeof(dp));
        memset(a, 0, sizeof(a));
        scanf("%d %d", &n, &m);
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                scanf("%lld", &a[i][j]);
                if(a[i][j] >= a[i-1][j])
                {
                    dp[i][j] = dp[i-1][j] + 1;
                }
                else    dp[i][j] = 1;
            }
        }
        /*for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <=m ; j++)
            {
                cout<<dp[i][j]<<" ";
            }
            cout<<endl;
        }*/
        ans = m; cnt = 0; minn = N;//结果最小就是单行，个数就为 m 
        
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                if(dp[i][j] != 1)
                {
                    cnt++;
                    minn = min(minn, dp[i][j]);
                    if(j == m)
                    {
                        ans = max(ans, cnt * minn);//更新答案 
                        cnt = 0;//重置 
                        minn = N;
                    }
                }
                else//另起子矩阵 
                {
                    ans = max(ans, cnt * minn);//更新答案 
                    cnt = 0;//重置 
                    minn = N;
                }
            }
        }
        
        cout<<ans<<endl;
    }
    
    return 0;
}