2019牛客暑期多校训练营（第二场）- H - Second Large Rectangle

题目描述：

Given a $\mathrm{N\times MN\times M\; binary\; matrix.\; Please\; output\; the\; size\; of\; second\; large\; rectangle\; containing\; all\; "1""1".\; Containing\; all "1""1" means\; that\; the\; entries\; of\; the\; rectangle\; are\; all "1""1".}$

A rectangle can be defined as four integers  ${\mathrm{x1,y1,x2,y2x1,y1,x2,y2\; where\; 1\le x1\le x2\le N1\le x1\le x2\le N\; and\; 1\le y1\le y2\le M1\le y1\le y2\le M.\; Then,\; the\; rectangle\; is\; composed\; of\; all\; the\; cell\; (x,\; y)\; where\; x1\le x\le x2x1\le x\le x2\; and\; y1\le y\le y2y1\le y\le y2.\; If\; all\; of\; the\; cell\; in\; the\; rectangle\; is\; "1""1",\; this\; is\; a\; valid\; rectangle.}}^{}$

Please find out the size of the second largest rectangle, two rectangles are different if exists a cell belonged to one of them but not belonged to the other.

 

输入描述：

The first line of input contains two space-separated integers N and M.
Following N lines each contains M characters ${\mathrm{cijcij.1\le N,M\le 10001\le N,M\le 1000N\times M\ge 2N\times M\ge 2cij\in "01"cij\in "01"}}^{}$

 

${\mathrm{输出描述：}}^{}$

 

${\mathrm{Output\; one\; line\; containing\; an\; integer\; representing\; the\; answer.\; If\; there\; are\; less\; than\; 2\; rectangles\; containning\; all\; "1""1",\; output\; "0""0".}}^{}$

 

${\mathrm{样例：}}^{}$

题目大意：给一个n*m的01矩阵，求所有全为1组成的矩阵中第二大的1矩阵的面积，如果1矩阵不足2个，输出0。

解题代码：

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
const int _ = 1005;
int dp[_][_];
int secArea = -1,maxArea = -1;
int main()
{
    int n,m;
    memset(dp,0,sizeof(dp));
    cin>>n>>m;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            scanf("%1d",&dp[i][j]);
            dp[i][j]+=dp[i][j]*dp[i-1][j];
        }
    }//预处理dp[i][j]为该点上方路连续1的最大值
    for(int i = 1; i<=n; i++)
    {
        for(int j = 1; j<=m; j++)
        {
            int height = dp[i][j];
            int wide = 1;
            //当前矩阵的高和宽
            while(height)
            {
                int Area = height*wide;
                if(Area>maxArea)
                {
                    secArea = maxArea;
                    maxArea = Area;
                }
                else if(Area>secArea)
                {
                    secArea = Area;
                }
                height = min(height,dp[i][j-wide]);
                wide++;
            }
        }
    }
    cout<<(secArea == -1 ? 0 : secArea)<<endl;
    return 0;

}

 

转载于:https://www.cnblogs.com/cloudplankroader/p/11226752.html